Consider a set of 2-dimensional data points as follows: (1, 3), (1, 8), (2, 2), (2, 10), (3, 6), (4, 1), (5,4), (6, 8), (7, 4), (7, 7), (8, 2), (8, 5) and (9, 9). They have been plotted on a 2-D graph for convenience. Y 11 10 9 7 6 5 4 3 2 1 0 0 1 3 5 (a) Construct a balanced 2D-tree to store this data set 7 8 9 10 X (b) Using your 2D-tree, write the steps in finding the nearest neighbor of a query point (4,8). [use the back of the previous page for this answer]