IMG_2742

I « IV IV Ul Using Prim'’s Algorithm, determine the minimum spanning tree of the following graph. What is the weight of the minimum spanning tree (the sum of the weights of the edges included in the minimum spanning tree)? Please enter a numerical answer only; do not enter any letters or words. Answer: { }x What is the Big-Oh complexity of the selection sort? Select one: a. 0O(n) b. O(log n) c. O(n? d. 02" True/False: A graph with edges that have no directional indication as in the following diagram is called a uni-directed graph. Select one: True False