(d) Show how to use the k-d tree from (c) to find the nearest neighbor of (14,3). (Hint: you may use Euclidean distance for computing the distance between any pair of 2-dimensional instances.) (10%)

4. A palindrome is a string that can be read backwards, and forwards with the same result. For instance, the following string is a palindrome abbbdacadbbba Write an algorithm in pseudocode using a stack to test if a string is a palindrome. (20%)