PLEASE ANSWER AND EXPLAIN ONLY IF YOU'RE QUALIFIED ABOUT THE TOPIC.

Problem 4.2 (R4) What you need to show: Provide just an answer for each question. There is no need to explain. B B E E Graph of G2 Graph of G3 Using the graphs above answer the following questions about G. Note you do NOT need to know about G nor can you find G. Any answer that attempts to find G will received a Not Yet. a) How many vertices can reach the vertex C in a walk of length 2? b) Starting at B how many vertices can be reached by a walk of length 5? c) How many vertices can you start a closed walk of length 6 from? d) There is a walk of length 5 from A to E, what is the third vertex in the walk? Note that A is the first vertex in the walk. The last vertex of a walk of length n is the (n+1)th, not the nth vertex.Problem 4.2 (R.4) Explanation (Not required, but putting an explanation may help you need to request a regrade)