Question 1: (20 points) You are given a single linked list that contains data of integers. Write a method named find Middle Node that returns the middle node of the list. If the list has an even number of nodes, the method should return the second middle node. Note: Handle both even and odd length cases appropriately. If the list has an even number of nodes, the method should return the second middle node. The method should handle any number of nods including empty lined list. Examples 1-2 Return 2 1 2 3 Return 2 1null return 1 //Method header public static Node findMiddleNode (Node head) {