Which of the following statements on representing trees$/$forests $($directed or undirected$)$ are correct? For wrong ticks negative marks are given.

Which of the following statements on representing trees$/$forests $($directed or undirected$)$ are correct? For wrong ticks negative marks are given.

For the spanning trees and forests of BFS and DFS$,$ for every node we store the list of its children.

If there are n vertices in the input graph or digraph, then any spanning forest $($directed or undirected$)$ has at most n$-1$ edges$/$arcs$.$

Consider only connected graphs $($undirected$)$: Since the basic tasks of BFS and DFS are rather different, they need different representations of the spanning tree they compute.

For BFS and DFS$,$ for every vertex we just store the unique parent $($if it's not a root$).$