Problem 3:

Solution in English:

Find out travel time. Store as tripLength.

Find out leave time. Store as leaveTime.

Calculate travel time plus trip length. Store as variable minTime.

Find out available landing times. Store as availableTimes.

Compare minTime to each available time

If available time is equal to or later than minTime, land in Courtenay

If no available time later than minTime, land in Smit’s Field

Solution in Flow Chart: