Consider the statements about the following network:
I. The graph is connected;
II. The graph will have 2 components if edge DG is removed;
III. Edge AD is a bridge;
IV. When applying the Breadth-First Search (BFS) algorithm starting from node D, node C and node E will be the last to be visited.
Which alternative lists all correct statements?
a) I
b) I, II
c) I, III
d) I, III, IV
e) None of the above
Original idea by: Gabriel Sato
