Given a directed graph, write a java program that detects if every node is reachable from every other node. If yes, print the message "all nodes are reachable from all nodes". If not, print the message "all nodes are not reachable from all other nodes". Then, mention which nodes need to be connected to make them reachable from all other nodes. Use minimum number of new edges to make the graph connected. For example, $*$ Left Fig: "all nodes are reachable from all nodes" $*$ Right Fig : "all nodes are not reachable from all other nodes". For the second part several answers are possible. One answer could be $"\text{'}$Connect $3a2$ and $42"$

Test the code for the following graphs