Implement a function that reverses a list of elemnts by pushing them onto a stack in one order, and writing them back to the list in reversed order.

#A simple implementation of stack

class Stack:

def$\_$init$\_($self$)$:

self.items $=[]$

def is$\_$empty$($self$)$:

return self.items $=[]$

def push$($self$,$ item$)$:

self. items $.$ append $($item$)$

def pop$($self$)$:

return self.items.pop$()$

def reverse$($sequence$)$:

#TODO: implement this function that reverses a list with a stack

$L=$ list $($range $(1,11))$

reverse$($L$)$

print$($L$)$