In Kruskal, in every iteration, an edge of the most minimum weight (greediest) possible is selected and added to MST construction. Hence, greedy.
In Quick Sort, we partition the problem into subproblems, solve them and then combine. Hence, it is Divide & Conquer.
Floyd-Warshall uses Dynamic programming.
Hence, correct answer is : OPTION (C).