What is true about a graph G and its corresponding MST$?$

In Prim's algorithm, MST tree T begins as an edge set E from G

MST and G must include the same number of edges

In the Reverse$-$Delete algorithm, MST tree T begins as an empty set $($nothing from G$)$

Correct!

MST and G must include the same number of nodes