Question 1180634
Here's the solution to maximize Abheedette's profit:

**a. Define the variables used:**

* Let `x` be the number of trays of banana muffins.
* Let `y` be the number of trays of blueberry muffins.

**b. LP Model:**

* **Objective function:** Maximize profit (P) = 60x + 120y
* **Constraints:**
    * Milk: 2x + 4y ≤ 16
    * Flour: 3x + 3y ≤ 15
    * Non-negativity: x ≥ 0, y ≥ 0

**c. Identify the feasible region:**

To graph the feasible region, we'll first find the intercepts of the constraint lines:

* **Milk constraint (2x + 4y ≤ 16):**
    * x-intercept (y = 0): 2x = 16 => x = 8
    * y-intercept (x = 0): 4y = 16 => y = 4

* **Flour constraint (3x + 3y ≤ 15):**
    * x-intercept (y = 0): 3x = 15 => x = 5
    * y-intercept (x = 0): 3y = 15 => y = 5

Now, plot these lines and shade the region that satisfies all constraints (including non-negativity). The feasible region is a polygon with vertices at (0, 0), (0, 4), (3, 3), and (5, 0).

**d. Corner Points and the objective functions:**

Evaluate the objective function (P = 60x + 120y) at each corner point:

* (0, 0): P = 60(0) + 120(0) = 0
* (0, 4): P = 60(0) + 120(4) = 480
* (3, 3): P = 60(3) + 120(3) = 540
* (5, 0): P = 60(5) + 120(0) = 300

**e. Optimal Solution (final answer):**

The maximum profit of P540.00 is achieved when Abheedette bakes 3 trays of banana muffins and 3 trays of blueberry muffins.