Consider a relation s with one attribute A. Suppose you have to insert the following A = {89, 88, 90, 107, 86, 53, 52, 87, 34, 17, 35, 16} into the relation s. Construct a B+-tree on the attribute A of s. Following the pseudo- code of B+-tree given in the textbook (or the slides in ch1l1.ppt), construct a B+-tree with n = 3. Assume that the B+-tree is initially empty. 1 Question 2: In Question-1, we give a B+-tree with n = 3. Suppose that you are asked to construct a B+-tree with n = 2. Give your judgment on whether it is good or not to construct such a B+-tree. Explain it in details.