plot the figures and explain every step.

Question 1: Suppose we have the following numbers, 1, 2, 3, 4, 5, 6, and 7 (order does not matter here). Build-

1) a binary search tree that has the minimum height and

2) the binary search trees that has the maximum height (two cases)

Question 2: There is a sequence of numbers: {50,76,21,4,32,64,15,52,14,100,83,2,2,70,87,80}. Suppose you have an empty binary search tree then add the numbers one by one from the sequence in order.