The following is a graph (a) and its corresponding adjacency list is ... R 2 R 1x TI AT w - Sw L VINILI - o Y -10-27 (b) A True B False Given the following Binary Search Tree, if 11 and 19 are removed, the preorder of the resultant tree will be: A 10,6,4,5,8,43,31,49,17 B) 6,4,5,8,10, 17,43,31,49 10,6,4,5,8,17,43,31,49 D 4,5,6,8,10,17,31,43,49