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