1. [10] Given the following definitions and variables, for each item in the table below (1) to (10), identify the best matching item from (a) to (i). Suggestion: examine all items 1-10 and a-j before proceeding. class Node: def init (self, v, next-None): self._ , self._next = v, next P. q = Node (5, Node (3, Node (7))) None for v in 5, 3, 7: q = Node (v, q) N = 5; A, B, i, j = [], [0] *N, 4, 1 1) self. next = None a) Traversal 2) B.append (4) b) Queue B.pop() 3) q-> c) Circular queue 4) "3 + 6+2 / 5-1 " d) 5 -> 3 -> 7 -> END 5) B[i] = 4 e) 3, 6, 2, +, 1, i = (i+1) N 6) f) Linked list while t != None t = t. next 7) g) Binary search tree 8) A.append(4) h) 7 -> 3 5 -> END A. append(2) A.pop (0) 9) self. left = None i) Stack self._right = None 10) " 3+ ( 6+ 2) / (5-1) j) 36 * 2 5 / + 1 -" t =P The P->