What should be the output if the Depth$-$First Search algorithm is applied on the following graph. Where node $A$ is the source node.

a$)$ A single tree that contains only nodes A and B$.$

b$)$ A forest that contains two trees.

c$)$ A single tree that contains all nodes.

d$)$ A forest That contains four trees.