The intersection graph of a collection of sets {A_1, ., A_n} is the graph with vertices A_1, .., A_n, where vertices A_i and A_j are adjacent if and only if their intersection is non-empty. Construct the intersection graph for each of the following collections of sets. (a) A_1 = {0, 2, 4, 6, 8}, A_2 = {0, 1, 2, 3, 4}, A_3 = {1, 3, 5, 7, 9}, A_4 = {5, 6, 7, 8, 9}, A_5 = {0, 1, 8, 9} (b) A_1 = {..., -4, -3, -2, -1, 0}, A_2 = {..., -2, -1, 0, 1, 2, ..}, A_3 = { .., -6, -4, -2, 0, 2, 4, 6, ..}, A_4 = {..., -5, -3, -1, 1, 3, 5, ...}, (c) A_1 = (-infinity, 0), A_2 = (-1, 0), A_3 = (0, 1), A_4 = (-1, infinity), A_5 = R