(a) Show that for every graph G, where x(G) is the chromatic number of the graph G and Ama(G) is the largest eigenvalue of the adjacency matrix of G. Find the eigemvalusof adjacney matrik of the graph abowe (c) if H is an induced subgraph of G show that