3. Given the following directed graph, answer the questions below: 6 a) How many paths exist from vertex A to vertex K? Justify your answer by listing the paths. b) Is the graph weakly connected? Justify your answer c Is the graph strongly connected? Justify your answer. If not, find the strongly connected components. d) Suppose the edge (G,K) is 'reversed' so it is now the edge (K,G) i. How many paths exist from vertex A to vertex K? Justify your answer. ii How many paths exist from vertex A to vertex K if they are required to be simple paths? Justify your answer? Does the reversal' change your answer or the justification in c) above? Justify