As the intrepid computer scientist/archaeologist adventurer Wisconsin Jones, you have be researching the roots of the ancient student society ORO. A recent set of discovers have brought deep into Caribbean as you have possibly connected O to the ancient, advanced civilization of Atlantis. During one dive, you discover the most remarkable tablet: It describes a problem MAXFLOWALLORNOTHING, which is equivalent to the familiar problem MAXFLOW (given a flow network with source s and sink t and capacities on each edge, is there a flow value of at least k from s to t ) except edges cannot be partially filled with flow they must either have no flow, or be filled to capacity. For example, if an edge e has capacity 3 , any flow must send either 0 or 3 flow through e. The tablet includes an incomplete reduction from MaxFLowALLOrNotHING to MaxFLow. What are the odds that computer scientist/archaeologist would make such a discoveryl Even more incredible, etched NP-complete - use SUBSETSUM!" It might seem like it would be easier to find the max flow when the edges have this all-or-nothing constraint, but it seems you will show that it is actually (NP)-harderl 5.1. (1 point) Suppose the tablet contained a complete and correct polynomial time reduction from MAXFLOWALLORNOTHING, claimed to be NP-complete, to MAXFLow, would this imply: A. NP=P B. NP=P. C. None of the above. 5.2. (9 points) Show that MAXFLowALLOrNotHING is NP-complete. (a) (2 points) Show that MAXFLOWALLORNOTHING is in NP. (b) ( 7 points) Show that MaxFLowALLORNoTHING is NP-hard