Write a python program that takes two lists, merges the two lists, sorts the resulting list, and then finds the median of the elements in the two lists. **[You cannot use python build-in sort() function, you can call your own sort function or copy your code from previous tasks instead]** ===================================================== **Sample Input 1** list_one = \[1, 2, 1, 4\] list_two = \[5, 4, 1\] **Sample Output 1** Sorted list = \[1, 1, 1, 2, 4, 4, 5\] Median = 2 ===================================================== **Sample Input 2** list_one = \[1, 7, 9, 10\] list_two = \[2, 7, 6, 5\] **Sample Output 2** Sorted list = \[1, 2, 5, 6, 7, 7, 9, 10\] Median = 6.5 this is my code but its not returning median  #todo #You can use math functions like math.floor to help the calculation  import math def task7(list_in_1, list_in_2):   # YOUR CODE HERE     list_in_1.extend(list_in_2)     sort_list=[]     while list_in_1:         min=list_in_1[0]         for x in list_in_1:             if x

Write a python program that takes two lists, merges the
two lists, sorts the resulting list, and then finds the median of the
elements in the two lists.

**<font color='red'>[You cannot use python build-in sort() function, you can call your own sort function or copy your code from previous tasks instead]</font>**

=====================================================

**Sample Input 1**

list_one = \[1, 2, 1, 4\]

list_two = \[5, 4, 1\]

**Sample Output 1**

Sorted list = \[1, 1, 1, 2, 4, 4, 5\]

Median = 2

=====================================================

**Sample Input 2**

list_one = \[1, 7, 9, 10\]

list_two = \[2, 7, 6, 5\]

**Sample Output 2**

Sorted list = \[1, 2, 5, 6, 7, 7, 9, 10\]

Median = 6.5

this is my code but its not returning median 

#todo
#You can use math functions like math.floor to help the calculation 
import math

def task7(list_in_1, list_in_2):
  # YOUR CODE HERE
    list_in_1.extend(list_in_2)
    sort_list=[]
    while list_in_1:
        min=list_in_1[0]
        for x in list_in_1:
            if x<min:
                min=x
        sort_list.append(min)
        list_in_1.remove(min)
    print("Sorted List ",sort_list)
    if(len(sort_list))%2!=0:
        median=int((len(sort_list)+1)/2-1)
        return sort_list[median]
    else:
        median1=int(len(sort_list)/2-1)
        median2=int(len(sort_list)/2)
        return (sort_list[median1]+sort_list[median2])/2
n=int(input("no of elements in List1\n"))
l1=[]
print("Enter elements in List1")
for i in range(n):
    i=int(input(""))
    l1.append(i)
k=int(input("no of elements in list2\n"))
print("Enter elements of list2")
l2=[]
for j in range(k):
    j=int(input(""))
    l2.append(j)