Q1. [30 points] Write a program to create a single linked list, with the following node struct and allow user to input integer numbers to initialize the list. typedefstructlistnodefintdata;structlistnode*next;}node;/listnodestruct//integerfield*//self-referentialpointerfield*/ Given the head pointer of the above singly linked list, return the middle node of the linked list. If there are two middle nodes, return the second middle node. What are the time complexity of finding the middle of the linked list size n ? Explain. Example 1: - Input: head =[1,2,3,4,5] - Output: [3,4,5] - Explanation: The middle node of the list is node 3. Example 2: - Input: head =[1,2,3,4,5,6] - Output: [4,5,6] - Explanation: Since the list has two middle nodes with values 3 and 4, we return the second one