(1) (1 point) Build a BST from the list A = using alphabetical order assuming digits are less than letters;

(2) (1 point) Give a high level description of an algorithm (not pseudo code) to build a minimum height BST from a sorted array. What is the time complexity of your algorithm?

(3) (1 point) Design an algorithm (pseudo code) to find the lowest common ancestor of two given nodes (the root of the smallest subtree above the given nodes) in a BST. What is the time complexity of your algorithm?