The proof that the Node cover problem is NP-complete depends on a construction given in the class videos, which reduces 3SAT to Node Cover. Apply this construction to the 3SAT instance: (u+V+W) (-V+-W+x) (-U+-X+y) (X+-Y+z) (u+-W+-z) Note that - denotes negation, e.g., -v stands for the literal NOT v. Also, remember that the construction involves the creation of nodes denoted [i, j The node [i, j] corresponds to the th literal of the ith clause. For example, [1,2] corresponds to the occurrence of v. After performing the construction, identify from the list below the one pair of nodes that does NOT have an edge between them. C [1,2] and [5,3] [5,1] and [5,2] [1,1] and [1,3] [2,3] and [3,2]