<p><img alt="5. Consider the following problem: Given a directed graph G (V, E), if there exists a vertex in V that can reach all other ve" src="https://media.cheggcdn.com/media%2F1ac%2F1acb4457-4bb1-41d6-9667-27510712e63e%2FphptEdm2m.png" style="height:236px;width:668px;" aria-describedby="d3f"/></p><p>Please show