Computer Algorithm Multiple Choice Question: Pick one statement below that provides the best explanation for why the worst-case running time of Kruskal's algorithm can never be faster than O(m log n)? A. Since Dijkstra's algorithm runs in O(m log n) time, so must Kruskal's algorithm, which Dikstra's variant B. When working with any type of tree data structure, the optimal worst-case running time is O(m log n) C. The graph's edges need to be arranged in ascending order initially I will upvote correct answer only