Let G = (V,E) be a simple graph with V = {1,2,3,4,5}. (a) Given the list of neigbours array N where N₁ = {2,5}, N2 = {1,4,5}, №3 = {4}, N4 = {2,3}, and N = {1,2}, draw G. (b) Given the edges E = {{1,3}, {2,3}, {3, 4}, {3,5}, {4,5} give the list of neighbours array for E. (c) What is advantage of the list of neighbours representation N over the set of pairs of vertexes representation for E?