Prof. Stewart Weiss Spring 2018 CSci335 Software Design and Analysis III Eram 1A Name: Answer all questions in the space profided. Usothe backs of the sheets for scratch work. 1" (12%) True or False? Circle T if the statement is true and F if it is not true. In the worst case, the number of steps in a remove operation in a binary search tree with n nodes is proportional to n. The internal path length of a binary tree of height h must be less than the internal path length of a binary tree of heighth+ 1. For all functions f, g, and h, if log2(n) E6(logs(n)). T F T F T T T F F f(n)60(g(n)) and g(n) E (h(n)) then f(n) o(h(n)). e F If every node whose depth is d has heigh t h in a binary tree, then the tree has height h 2, (6%) Give an example of a function f(n) s uol