Which of the following is correct about Prim and Kruskal Algoritms? $(2$p$.)$ Kruskal is better

a$)$ If the number of edges is close to number of nodes in a network,

b$)$ The tree can be disconnected in Prim algorithm

c$)$ The tree must be connected in Kruskal algorithm

d$)$ Prim algorithm guarantees the optimal solution

e$)$ Kruskal algorithm guarantees the optimal solution