The intersection graph of a collection of sets A₁, A₂, . . . , A_n is the graph that has a vertex for each of these sets and has an edge connecting the vertices representing two sets if these sets have a nonempty intersection.

a) Upload the file for the following problem:

Construct the intersection graph of these collections of sets:

A₁ = {0, 2, 4, 6, 8}, A₂ = {0, 1, 2, 3, 4}, A₃ = {1, 3, 5, 7, 9}, A₄ = {5, 6, 7, 8, 9}, A₅ = {0, 1, 8, 9}

b) Upload the file for the following problem:

Construct the intersection graph of these collections of sets:

A₁ = {. . . ,4,3,2,1, 0} A₂ = {. . . ,2,1, 0, 1, 2, . . .} A₃ = {. . . ,6,4,2, 0, 2, 4, 6, . . .} A₄ = {. . . ,5,3,1, 1, 3, 5, . . .} A₅ = {. . . ,6,3, 0, 3, 6, . . .}

c) Upload the file for the following problem:

Construct the intersection graph of these collections of sets:

A₁ = {x | x < 0} A₂ = {x | 1 < x < 0} A₃ = {x | 0 < x < 1} A₄ = {x | 1 < x < 1} A₅ = {x | x > 1} A₆ = R