Final Answer:
To maximize his profit, Brantley should make 4 batches of cookies and 3 cakes each day.
Step-by-step explanation:
Let's denote the number of batches of cookies as C and the number of cakes as \(K\). The profit for each batch of cookies is the same as the profit for each cake.
The constraints are the budgeted flour and baking time:
![\[2C + 3K \leq 30\] (flour constraint)](https://img.qammunity.org/2024/formulas/mathematics/high-school/f2pq1qpd609bp2i0m6oo67qm2tceztpmuj.png)
![\[60C + 45K \leq 540\] (time constraint, converted to minutes)](https://img.qammunity.org/2024/formulas/mathematics/high-school/yc6nolfmzdjnzq9jjs8yvglc5r1urmw0lb.png)
The objective function is to maximize profit:
![\[P = 4C + 3K\]](https://img.qammunity.org/2024/formulas/mathematics/high-school/59aijxycv8ksajlaz6gwapwrw1xvn02s71.png)
To solve this linear programming problem, we can use the simplex method or a graphical method. For brevity, let's use the graphical method.
Plotting the constraints on a graph, the feasible region is the area where the constraints overlap. The corner points of this region are calculated to determine the maximum profit. Solving the system of equations for these corner points gives the maximum profit at

Therefore, Brantley should make 4 batches of cookies and 3 cakes each day to maximize his profit.