Write a method that inserts an int into an ordered list that is implemented as a linked list.

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 search tree to require the maximum number of array elements?

e$)$ How many array elements would be needed for the array described in part d$?$