The list method reverse reverses the elements in the list. Define a function named reverse that reverses the elements in its list argument (without using the inbuilt reverse() list method). Try to make this function as efficient as possible, and state its computational complexity using big-O notation.

here is the code that must be used.
def reverse(lyst):
write code here
def main():
"""Tests with two lists."""
lyst = list(range(4))
reverse(lyst)
print(lyst)
lyst = list(range(3))
reverse(lyst)
print(lyst)

if __name__ == "__main__":
main()

python please!