Hi there
in first part state whether it’s true or not
Then comes towards the second
provide efficient proof of correctness please
and if it doesn’t works provide efficient example I mean counterexample
I need solution asap
thanks
5. Consider the following problem: Given a directed graph G (V, E), if there exists a vertex in V that can reach all other vertices in V then return TRUE. Otherwise return FALSE Consider the following algorithm that claims
OR
OR