ans is (c)
path in a graph is a finite or infinite sequence of edges which connect a sequence of vertices which, by most definitions, are all distinct from one another. In a directed graph, a directed path (sometimes called dipath[1]) is again a sequence of edges (or arcs) which connect a sequence of vertices, but with the added restriction that the edges all be directed in the same direction.
walk is any route through a graph from vertex to vertex along edges. A walk can end on the same vertex on which it began or on a different vertex. A walk can travel over any edge and any vertex any number of times.
a tree is an undirected graph in which any two vertices are connected by exactly one path. In other words, any acyclic connected graph is a tree
A circuit is path that begins and ends at the same vertex. Cycle. A circuit that doesn't repeat vertices is called a cycle. A Connected Graph. A graph is said to be connected if any two of its vertices are joined by a path