Define a function that takes the head of a linked list as an argument and reverses the linked list. The definition of the linked list has already been provided to you. The program prints the reversed linked list as output. class Node: def_init_(self, data): self.data = data self.next = None class LinkedList: def__init_(self): self. head = None def reverse(self): \#write your code here def printlist(self): temp = sel f. head while (temp): print(temp.data, end=" ") temp = temp.next list = LinkedList () n=int( input ()) data = input () if n==len( data.split()): for i in data.split(): list. append(int (i)) liist. reverse() liist.printList()