Problem 2. Consider a graph G =(V,E) where |V|=n.
2(a) What is the total number of possible paths of lengthk ? 0 in G from a given starting vertexs and ending vertex t? Hint: a path of lengthk is a sequence of k + 1 vertices withoutduplicates.
2(b) What is the total number of possible paths of any length inG from a given starting vertex s and endingvertex t?
2(c) What is the total number of possible cycles of any lengthin G from a given starting vertex s?
