Given table 20.7. Find the smallest number of planes capable of implementing this timetable

20.11 Construct an unbounded transportation problem or show that there is no 20.12 Eastern Provincial Airways flights served by Boeing 737 are listed in Table 207. Table 20.7 Flight Timetable Number Departure Arrival Frequency U T 111 112 Daily 101 St. John's 6:55 Montreal 11:15 Daily 102 Montreal 16:10 St. John's 23:10 Daily St. John's 23:35 Gander 0:05 MWF Sat 103 Gander 8:15 St. John's 8:45 ThSu St. John's 9:25 Wabush 12:20 Th F Su 104 Wabush 13:35 St John's 17:55 ThFSu 107 Charlottetown 6:45 Montreal 7:55 Daily 10B Montreal 18:55 Halifax 21:50 Daily 109 St. John's 18:40 Halifax 21:10 Except W St. John's 19:45 Halifax 22:15 w 110 Halifax 9:40 St John's 12:20 Except Su Halifax 9:00 St. John's 12:20 Su St. John's 13:00 Montreal 17:10 Daily Montreal 9:00 St John's 16:10 115 Gander 8:15 Wabush 12:30 Tu 116 Wabush 13:15 St John's 17:55 Tu Sat 117 Chatham 15:05 Montreal 15:23 Except Saz 118 Montreal 11:55 Chatham 14:45 Except Sat 119 St. John's 7:35 Wabush 11:15 M 120 Wabush 15:50 Gander 21:05 M Gander 7:40 Wabush 12:30 Sat 124 Gander 6:00 St. John's 6:30 Daily 125 St. John's 7:20 Wabush 10:00 W 126 Wabush 14:35 St. John's 19:00 w 127 St. John's 17:10 Halifax 18:15 Daily Halifax 19:15 Gander 22:00 Daily 151 St. John's 15:10 Toronto 18:05 Daily 152 Toronto 9:15 St. John's 14:25 Daily 153 Halifax 7:05 Toronto 8:30 Daily 154 Toronto 19.15 Charlottetown 23:10 Daily Find the smallest number of planes capable of implementing this timetable (and justity your answer) Can you state and prove a relevant minimax theorem? The 123 such is el * (mes a pa shall plex SO-a prob 134 m The 20.11 Construct an unbounded transportation problem or show that there is no 20.12 Eastern Provincial Airways flights served by Boeing 737 are listed in Table 207. Table 20.7 Flight Timetable Number Departure Arrival Frequency U T 111 112 Daily 101 St. John's 6:55 Montreal 11:15 Daily 102 Montreal 16:10 St. John's 23:10 Daily St. John's 23:35 Gander 0:05 MWF Sat 103 Gander 8:15 St. John's 8:45 ThSu St. John's 9:25 Wabush 12:20 Th F Su 104 Wabush 13:35 St John's 17:55 ThFSu 107 Charlottetown 6:45 Montreal 7:55 Daily 10B Montreal 18:55 Halifax 21:50 Daily 109 St. John's 18:40 Halifax 21:10 Except W St. John's 19:45 Halifax 22:15 w 110 Halifax 9:40 St John's 12:20 Except Su Halifax 9:00 St. John's 12:20 Su St. John's 13:00 Montreal 17:10 Daily Montreal 9:00 St John's 16:10 115 Gander 8:15 Wabush 12:30 Tu 116 Wabush 13:15 St John's 17:55 Tu Sat 117 Chatham 15:05 Montreal 15:23 Except Saz 118 Montreal 11:55 Chatham 14:45 Except Sat 119 St. John's 7:35 Wabush 11:15 M 120 Wabush 15:50 Gander 21:05 M Gander 7:40 Wabush 12:30 Sat 124 Gander 6:00 St. John's 6:30 Daily 125 St. John's 7:20 Wabush 10:00 W 126 Wabush 14:35 St. John's 19:00 w 127 St. John's 17:10 Halifax 18:15 Daily Halifax 19:15 Gander 22:00 Daily 151 St. John's 15:10 Toronto 18:05 Daily 152 Toronto 9:15 St. John's 14:25 Daily 153 Halifax 7:05 Toronto 8:30 Daily 154 Toronto 19.15 Charlottetown 23:10 Daily Find the smallest number of planes capable of implementing this timetable (and justity your answer) Can you state and prove a relevant minimax theorem? The 123 such is el * (mes a pa shall plex SO-a prob 134 m The