Reference no: EM132168807
Write a python function consumes an ascending order list and a descending order list and return a new list with all elements in ascending order.
For example
fun1([1,2],[3,2])returns [1,2,2,3]
Write another python function consumed 3 ascending lists and return a new list will all elements in ascending order. Must first merge the three lists until one of them is completed, then continue merging the left two.
For example
fun2([1,2],[1,3,5],[3,5])returns [1,1,2,3,3,5,5]
For both functions:
No buildin function sort
no helper function
no module except math
no recursion nor abstract list function