Solve the Camel Banana problem and then walk me through how you would approach the follow-up case study.
Use the supplied tables to calculate the bananas remaining after every transport stage for problem 1. Assume each camel consumes one banana per kilometer, and every forward or return trip consumes bananas for each camel currently traveling.
stage_no, start_bananas, required_trips, bananas_consumed, ending_bananasstage_no ascendingbananas_at_start as start_bananas, rather than carrying forward the previous ending amount.required_trips to CEIL(2 * start_bananas / camel_capacity - 1) when start_bananas exceeds camel_capacity; otherwise use 1.bananas_consumed as (2 * required_trips - 1) * distance_km * consumption_per_km.ending_bananas to 0 when the calculated remainder is negative.| Column | Type | Description |
|---|---|---|
| problem_idPK | INT | Identifier for a Camel Banana problem instance |
| initial_bananas | INT | Initial number of bananas |
| camel_capacity | INT | Maximum bananas carried by one camel |
| consumption_per_km | INT | Bananas consumed by one camel per kilometer |
| target_distance_km | INT | Total intended travel distance |
| Column | Type | Description |
|---|---|---|
| stage_idPK | INT | Unique route stage identifier |
| problem_id | INT | Related Camel Banana problem |
| stage_no | INT | Sequential stage number |
| distance_km | INT | Distance covered in the stage |
| bananas_at_start | INT | Bananas available at the start of the stage |