For the following problem, describe algorithms in pseudocode that solve the problem and analyze the running time of your algorithms to show they run within the required time bound. Give an O(n)-time non-recursive procedure that reverses a doubly linked list of n elements. The procedure should use no more than constant storage space beyond what is needed for the list itself