Construct a connected graph containing n vertices for which the3-Coloring Backtracking algorithm will take exponential time todiscover that the graph is not 3-colorable.
ALGORITHMS QUESTION. Show all work.Thank you
Expert Answer
An answer will be send to you shortly. . . . .