Week $8$ Part $2$ HW: Problem $3$

$(1$ point$)$ A tree is

A$.$ a disconnected directed graph with simple circuits.

B$.$ a connected undirected graph with no simple circuits.

C$.$ a connected undirected graph with simple circuits.

D$.$ a disconnected directed graph with no simple circuits.

E$.$ a connected directed graph with no simple circuits.

F$.$ a disconnected undirected graph with no simple circuits.

G$.$ a disconnected undirected graph with simple circuits.

H$.$ a connected directed graph with simple circuits.

I. None of the above