7.1.4 (a) Draw a graph with nodes representing the numbers 1,2,,10, in which two nodes are connected by an edge if and only if one is a divisor of the other. (b) Draw a graph with nodes representing the numbers 1,2,,10, in which two nodes are connected by an edge if and only if they have no common divisor larger than 1. (c) Find the number of edges and the degrees in these graphs, and check that Theorem 7.1.1 holds