€ e Consider the graph (V,E), V = {0, 1, 2} x {0,1,2} and E = {((n, m), a, (k, l))|(n, m) Є V, (k, l) Є V, n + m = k+l} U {((n, m), a, (k, l))|(n, m) € V, (k, l) € V, n − m = k − l}. This graph has vertices and - directed edges. - The largest strongly connected component in this graph has There is a/is no path from (2, 1) to (0, 1). If yes, a path is: vertices and directed edges.