There are two pools which are connected with a tiny water path between them. The widths of the first and second pools are 3 and 1 meters, respectively. The heights of both pools are 1 meters. There is always an additional 5m3 water in the system regardless of the heights of pools. We need to determine the lengths of these pools to have the maximum amount of water in the system. Assume there are the following physical restrictions on the lengths of these pools. Two of the first height plus one of the second height is at least 2 meters. Also, one of the first height plus three of the second height is at most 3 meters. Moreover, the second height cannot be more than 4 meters. A. forming the problem as linear programming [5 points] Please form this problem as a linear programming problem. B. solving linear programming by visualization [10 points] Answer these questions by solving the problem using visualization: What heights of these pools can result in the most most amount of What is the most amount of water in the system, considering that additional water? C. solving linear programming by tableau simplex method [20 points] Answer the questions of Section IV-B using the tableau simplex method