. Q1(20 points): Basic Data Structures: Stacks, Queues, Linked Lists and Trees (a) (7 points) Please write a pseudocode for List-Move(x, y). This procedure is to move an existing nodes z and insert it right before another existing node y in a doublyon circular list without a dummy head. List-Move(x, y) (b)(6 points) Given a binary tree T and a node r in the tree, please write a recursive method Depth (x) that returns the depth of the node r in the tree. Depth(x)