Match the following: 1) Fake coin problem A) Shortest Hamiltonian circuit 2) Floyd-Warshall Algorithm B) Class NP 3) Traveling salesman problem C) Can deal negative weight edges 4) Graph coloring problem D) Divide and conquer а) 1-D 2-B 3-А 4-С b) 1-B 2-С 3-А 4-D c) 1-C 2-D 3-B 4-A d) 1-D 2-C 3-A 4-B

Computer science question help

MUST BE DONE IN PHYTON

Question 1: In graph theory, a graph X is a "complement" of a graph F if which of the following is true?   Select one:   a. If X is isomorph to F, then X is a complement of F.   b. If X has half of the vertices of F (or if F has half of the vertices of X) then X is a complement of F.   c. If X has the same vertex set as F, and as its edges ONLY all possible edges NOT contained in F, then X is a complement of F.   d. If X is NOT isomorph to F, then X is a complement of F.   Question 2: Which statement is NOT true about Merge Sort Algorithm:   Select one:   a. Merge Sort time complexity for worst case scenarios is: O(n log n)   b. Merge Sort is a quadratic sorting algorithm   c. Merge Sort key disadvantage is space overhead as compared to Bubble Sort, Selection Sort and Insertion Sort.   d. Merge Sort adopts recursive approach

Explain the complete work !

Need help with computer science problem