Consider the following general form of a linear programming problem: Maximize Profit Subject to :Amount of resource A used 100 units Amount of resource B used 240 units Amount of resource C used 50 units The shadow price for S1 is 25, for S2 is 0, and for S3 is 40. If the right-hand side of constraint 3 were changed from 150 to 151, what would happen to maximum possible profit