State True of False.i) Network is a graph that has weights or costs associated with it.ii) An undirected graph which contains no cycles is called a forest.iii) A graph is said to be complete if there is no edge between every pair of vertices.

State True of False.i) Network is a graph that has weights or costs as

1.	State True of False.i) Network is a graph that has weights or costs associated with it.ii) An undirected graph which contains no cycles is called a forest.iii) A graph is said to be complete if there is no edge between every pair of vertices.
A.	True, False, True
B.	True, True, False
C.	True, True, True
D.	False, True, True
Answer» C. True, True, True