D Question 20 6 pts An algorithm A that uses backtracking traverses a search tree from the root down. At each node, A checks whether a solution can be completed down the node. If it cannot, the associated sub-tree is Time Atten 46 M 24/7 pruned O rotated O replaced O marked for revisiting Question 21 12 pts Select the name for the method that best describes it. Assume that Queue is a queue of binary tree nodes and root is the root of a binary tree. public void [Select ] randomize O { Queue a = new Que backtracking breadth_first_traversal if (root.getLeft dynamic_programming q.enqueue(rootegece CCTUM while (!q.isEmpty() { Node p = q.getFront(); q.dequeue; process(p.getInfo(); if (p.getLeftChild != null) q. enqueue(p.getLeftChild(); if (p.getRightChild() != null) q. enqueue(p.getRightChild(); } } }