Assignment 6 (Due Date: 07-July) The Dream SMP is the first place to be attacked by the army of the creepers and zombies. Dream with Mr. Beast has to take some important decisions to minimize the...

Extracted text: Assignment 6 (Due Date: 07-July) The Dream SMP is the first place to be attacked by the army of the creepers and zombies. Dream with Mr. Beast has to take some important decisions to minimize the damage from the zombies. Dream SMP can be denoted as a graph with N nodes. There are M roads each connecting 2 nodes - Ai and Bi. The road is directed from node Ai to Bi, and not vice-versa. The power required to travel on this road is Ci initially. Also, Dream SMP is built in such a way that it is not possible to visit the same node twice using these roads. That is, you cannot start at a node, follow some of the roads and return back to the same node. Your task is to stop the army of the dead. All zombies are standing at node 1 right now. For this, you decided to carry out Q steps of two different types - 1 K: Add value K to the power required to travel each road in Dream SMP. i.e., after this operation Ci=Ci+K Vie[1, M]. Value K can be negative as well. 2 Y: Find the minimum power required for the zombies to reach node Y in Dream SMP from node 1. Develop a pythonic code that for each query of type 2, output a single line answer to the minimum power required for zombies at node 1 to reach node Y. If there is no way to reach node Y, output "No way to win now!!!". Input: 33 121 133 232 1 23 Output: 2