Give a critical comparison of Kruskal's algorithm and Prim's algorithm to generate a minimum spanning tree.
a) Time complexity
b) Space complexity
c) Ease of implementation
d) All of the above