input: Write a python function to insert an element into a sorted list and maintain the sorted order.
  assert insertInSortedList([1, 2, 4, 5], 3) == [1, 2, 3, 4, 5]
  assert insertInSortedList([1, 3, 5, 7], 6) == [1, 3, 5, 6, 7]
  assert insertInSortedList([10, 20, 30], 15) == [10, 15, 20, 30]
  assert insertInSortedList([], 5) == [5]
  assert insertInSortedList([1, 2, 2, 2, 3], 2) == [1, 2, 2, 2, 2, 3]
output: def insertInSortedList(lst, element):
      for i in range(len(lst)):
          if element < lst[i]:
              lst.insert(i, element)
              return lst
      lst.append(element)
      return lst