A$.$ Write a non$-$recursive algorithm $($follow pseudocode style similar to Code Fragment $3\mathrm{.}11)$ for finding, by link hopping, the middle node of a doubly linked list with header and trailer sentinels$.($Note: This method must only use link hopping; it cannot use a counter.$)$

B$.$ What is the running time of this method?

i need the entire code written from beginning to end not just including the middle section thanks