2 Consider the following directed graphs on a set V of all integers from 0 to and including 99 . G1=(V,E1) where E1 is the set of all pairs (a,b)VV where amod5=bmod5 G2=(V,E2) where E2 is the set of all pairs (a,b)VV where (ab)mod5=1 G3=(V,E3) where E3 is the set of all pairs (a,b)VV where ab0 G4 is a DAG on V. Fill in the number of connected strongly and weakly connected components for each of the graphs. There are no negative points for incorrect answers. If there is no single correct answer (since G4 can be several different graphs) then fill in undefined. Otherwise fill in a number. G1 has weakly connected components and strongly connected components. G2 has weakly connected components and strongly connected components. G3 has weakly connected components and strongly connected components. G4 has weakly connected components and strongly connected components