6) A. Set up a binary tree for the following list, in the given order, using alphabetical ordering: SHE, SELLS, SEA, SHELLS, BY, THE, SEASHORE B. How many comparisons with words in the tree are needed to determine if the word SHARK is in the tree? 7) Find a spanning tree for the graph K,, using a depth-first search. (Assume that the vertices are labeled u, u, u, in one set and v,.v.v,v, in the other set, and that alphabetical ordering is used in the search, with numerical ordering on the subscripts used to break ties) 8) Find a minimal spanning tree for this weighted graph using Prim's algorithm. bi