Declare a function called reverse_linked_list (head) which will print the values of a linked list, one per line. But print them in reverse print the last element's value first, and the head node's value last. class ListNode: definit (self, val): self.val = val self.next = None __(self): def str vals = [] objs = set() curr = self while curr is not None: curr_str = str (curr.val) if curr in objs: vals.append("{} -> ... beyond)". format (curr_str)) break else: vals.append(curr_str) objs.add(curr) curr = curr.next return -> ".join(vals) (to infinity and