Reverse linked list utilizing stack adt

Question 5: Reverse a list Using a class Stack that you created in Question 4, develop a function, reverse_list, that takes a linked list as an argument and reverses it. You can't use Question 1 and convert a linked list to Python list. def reverse list (lst) >>reverse_list (LinkNode (2, LinkNode (4, LinkNode (6, LinkNode (8, 10 -8-6 -4-> 2-> None >>reverse_list (LinkNode (None) None-> None >>>reverse_list (LinkNode (2, LinkNode ('4',LinkNode (6, LinkNode ('m' 'm' -> 6- '4' -> 2-> None # YOUR CODE GOES HERE # class LinkNode: def (self.value.nxt=None ) : init assert isinstance(nxt, LinkNode) or nxt is None self.nextnxt def get_value(self) def set value (self,value): def get_next (self): def set next (self,nxt): def _repr_(self) def is_empty (self): return self.va lue return self.next self.nextnxt return repr(self.value)+ "->"repr(self.next) if self.valueNone: else: return True return False