Question No.1: Two simple graphs are given with the following adjacency matrices. G=010101101010010101101010010101101010,H=011100100110100011110001011001001110. Answer the following: a) Number of vertices b) Number of edges c) Degrees of vertices d) Graph of G and H e) G and H are Bipartite? If yes, show partitions f) Path of length three in G and H. If yes, write at least one path of length three g) G and H are isomorphic to each other? Give reason(s). h) Check whether the graphs G and H are connected or not