QUESTION 10 (5.2.020) THIS IS ALL THAT WAS GIVEN.

10. 5.2.020 Let T be a binary tree whose nodes are elements of some set U. The following algorithm searches T for a target value tEU and returns true if and only if t is a node in T. function Search (tEU, TE binary trees)) if T is empty then return false else if t= the root of return true then else return (Search (t, left subtree of T) V Search (t, right subtree of T)) (a) Write down a top-down evaluation of Search(17, T), where T is the tree in the figure below 27 31 12 17 14 92 57 71 65 23 Indicate whether each statement is True or False Search(17, T) = Search(17, T27jv Search(17, T31) = Search(17, O) v Search( 17, T12) v Search( 17, T17) v Search( 17, T14) (a) True or FalseSelect-v Search(17, T92) v Search(17, T5z) v true v Search(17, T23) v Search(17, TBa (b) True or FalseSelect- v Search(17, 0) v Search(17, 0) v Search(17, ) v Search(17, 0) Search(17, 0) (c) True or False (d) True or False true v Search(17, a) v Search(17, Select--, v false v false v false v false v true Select- Search( 17, O) false v false v false v false = | Indicate A, B, or C (b) Which type of algorithm is this? A O greedy algorithm B traversal algorithm C O divide-and-conquer algorithm