Font 9) Given the following list of values: 47, 83, 56, 30, 12,67,35,25, 80,61 a) Draw the binary search tree that would evolve by inserting the values into the tree in the order in which they are presented b) Draw the array representation of this binary search tree. c) In what order would you insert the values so as to get a complete binary search tree? d) In what order would you insert the values so as to get an array implementation of a binary s earch tree to requi the maximum number ofarray elements? e) How many array elements would be needed for the array describedin partd? f) Describe what do each of the following int binary search tree methods do: public BTN x int a) if if ((a > data) ((a n, data) n.right= BTN (a); if (a data) ((a n, data) n.right= BTN (a); if (a <.data><.data>