Assignment 6 5 points A small commuter airline uses a plane with the capacity to carry at most p passengers on a hopping flight The hopping flight visits the cities 1 2 n in ascending order The plane can pick up passengers at any node and drop them off at any other node Let bij denote the number of passengers available at node i who want to go to node j and let fi denote the fare per passenger from node i to node j The airline would like to determine the number of passengers that the plane should carry between the various origins and destinations in order to maximize the total fare per trip while never exceeding the plane capacity Model this problem as a minimum cost flow