S 2 Problem 1 (10 points]: Consider the following problem denoted WSP opt, defined as follows: Given a weighted undirected graph G = (V, E, w) and two vertices s and t where the ) weight of edge e is denoted we E R (we could be negative), find the shortest path from s to t, i.e., the path from s to t with minimum total edge weight. Additionally, define the prob- lem WSP-POSOPt to be identical, but where the edge weights are required to be strictly positive. Consider the following incorrect reduction that aims to show WSPOPT