answer the seqend question

The solution to the following recurrenc Select one: a. O(log n) O b. O(n^2) O C. on.log n) O d. P(n) Which of the following edges form a minimum spanning tree on the graph using Kruskal's algorithm? 1 5 Select one: O a. (A-G) (B-C) (E-F) (A-B) (C-F) (D-E) b. (A-G) (A-B) (A-C) (A-D) (A-D) (C-F) c. (A-G) (A-B) (B-C) (A-D) (C-F) (F-E) O d. (A-G) (G-C) (C-B) (C-F) (F-E) (E-D)