Merge Sort Algorithm to remove duplicates from a text list. Show Complexity Analysis. Example, [Mike,Keya,Mike,John] -> [Mike,Keya,John] The order doesn't matter.

Correct and detailed answer will be Upvoted. Thank you!

joinList(n) (2 pts) Takes an integer number n. This functions returns the list [1,2,...,n,n,...2,1] for every n>0. Preconditions: While the function will receive integer values, you should not make any assumptions about the value of n. Input An integer value Output list Starting at 1 moving upwards, a list with the sequence 1 to n, followed the sequence that starts at n moving downwards to 1 None Argument do not satisfy the conditions of the function Example: >>> joinList(5) [1, 2, 3, 4, 5, 5, 4, 3, 2, 1] >>> joinList(1) [1, 1] >>> joinlist(-3) is None True

ORIGINAL Q: Instead of reading in an entire list N1,N2,⋯N1​,N2,⋯​ all at once, some algorithms (depending on the task to be done) can read in only one element at a time and process that single element completely before inputting the next one. This can be a useful technique when the list is very big (e.g., billions of elements) and there might not be enough memory in the computer to store it in its entirety. Write an algorithm that reads in a sequence of values v≥0, one at a time, and computes the average of all the numbers. You should stop the computation when you input a value of V = −1. Do not include this negative value in your computations; it is not a piece of data but only a marker to identify the end of the list. PLEASE MODIFY THE FOLLOWING CODE SO THE USER INPUTS THE NUMBERS ONE BY ONE: ORIGINAL Q: Instead of reading in an entire list N1,N2,⋯N1 ,N2,⋯ all at once, some algorithms (depending on the task to be done) can read in only one element at a time and process that single…