1C – 4

Solution (in English)

• Find out (input) what time Mary will arrive in Courtenay.  Store it in a variable called       ‘arrival time’.
• Find out (input) available landing times.  Store it in a variable called ‘available’.
• Compare ‘arrival time’ with ‘available’.
• If ‘arrival time’ is less than or equal to ‘available’, Mary can land at the Courtenay Airport.
• If ‘arrival time’ is greater than ‘available’, Mary must land at Smitts Field.
• If Mary lands at the Courtenay Airport, add (input) 20 min to ‘arrival time’.
• If Mary lands at Smitts Field, add (input) 45 min to ‘arrival time’.
• Find out (Input) available reservation times.  Store it in a variable called ‘res times’.
• Compare ‘arrival time’ with ‘res times’.
• Output optimal reservation time.

Solution (Flow Chart)