[50 points] Design an algorithm that will take a list of numbers and reverse the order of the elements in the list, without making use of a second list variable. (Your solution may not use python's reverse function or slicing.)

Example of the algorithm: Input = [1, 2, 3, 4, 5, 6, 7, 8] Output = [8, 7, 6, 5, 4, 3, 2, 1] ---------------------------------------------------- Input = [1, 2, 3, 4, 5, 6, 7, 8, 9] Output = [9, 8, 7, 6, 5, 4, 3, 2, 1] ---------------------------------------------------- Input = [1, 2] Output = [2 ,1] ---------------------------------------------------- Input = [1 , 2 , 3] Output = [3 , 2 ,1]

Write the code in python please