Question 3 (10%) Describe a method for finding the middle node of a doubly linked list with header and trailer sentinels by "link hopping," and without relying on explicit knowledge of the size of the list. In the case of an even number of nodes, report the node slightly left of center as the "middle" What is the running time of this method? Hint: Consider a combined search from both ends. Also, recall that a link hop is an assign- ment of the form "p = p.getNext();" or "p = p.getPrev()