Suppose that you insert the following sequence of points into an initially empty kd-tree. Give the level order traversal of the resulting kd-tree. (In your answer, write the letters in uppercase separated by spaces.) A (0.15, 0.18) B (0.86, 0.26) C (0.70, 0.11) D (0.16, 0.01) E (0.62, 0.95) F(0.98, 0.04) G (0.87,0.79) H (0.83, 0.21) ing the x-coordinate at even levels (including the root) and using the y-coordinate at odd levels. Also, we use the left subtree for points with smaller x- or y-coordinates