Pouring Water You have a 10-liter container, a 7-liter container, and a 4-liter container. The large container is empty; the other two are You are challenged to rearrange the water, using as few operations as possible, so that there are exactly two liters in either the 7-liter or the 4-liter container. You are allowed to perform only one type of operation: pouring the contents of one container into another, stopping only when the source container is empty or the destination container is full. In this problem, your goal is to model this scenario as a graph and to solve it with a graph algorithm. D Question 1 4 pts What kind of graph would be best for modeling this scenario? Undirected, weighted Undirected, unweighted Directed, weighted Directed, unweighted D Question 2 4 pts In a one or two sentences, explain what each vertex in the graph should represent. HTML Editora BIVA-A- IE 5 V X 11 x X, DE 1 12pt - Paragraph - 0 words Question 3 4 pts In one or two sentences, explain what each edge in the graph should represent. HTML Editora x B I VA -AIE E. E O N V x 12pt V - Paragraph - O words Question 4 4 pts What specific question about the graph needs to be answered to solve the problem? HTML Editora 1 A I = = = = = = B E 3 A V = V = 12pt = Paragraph - O words Question 5 4 pts What algorithm should be used to answer the question that you posed above? Topological sort Depth-first search Strongly connected components Breadth first search Pouring Water You have a 10-liter container, a 7-liter container, and a 4-liter container. The large container is empty; the other two are You are challenged to rearrange the water, using as few operations as possible, so that there are exactly two liters in either the 7-liter or the 4-liter container. You are allowed to perform only one type of operation: pouring the contents of one container into another, stopping only when the source container is empty or the destination container is full. In this problem, your goal is to model this scenario as a graph and to solve it with a graph algorithm. D Question 1 4 pts What kind of graph would be best for modeling this scenario? Undirected, weighted Undirected, unweighted Directed, weighted Directed, unweighted D Question 2 4 pts In a one or two sentences, explain what each vertex in the graph should represent. HTML Editora BIVA-A- IE 5 V X 11 x X, DE 1 12pt - Paragraph - 0 words Question 3 4 pts In one or two sentences, explain what each edge in the graph should represent. HTML Editora x B I VA -AIE E. E O N V x 12pt V - Paragraph - O words Question 4 4 pts What specific question about the graph needs to be answered to solve the problem? HTML Editora 1 A I = = = = = = B E 3 A V = V = 12pt = Paragraph - O words Question 5 4 pts What algorithm should be used to answer the question that you posed above? Topological sort Depth-first search Strongly connected components Breadth first search
