(4 points) You have just returned from a long trip and brought back treats you would like to share with your friends. However, you want to give your friends a good variety of treats, so you wish to find a way to ensure that no friend receives the same type of treat too many times. You have n friends and m types of treats and are willing to give each friend at most k of the same treat. You also have quantities f1,,fnN, representing the number of treats you wish to give to each friend, and t1,,tmN, representing the number of each type of treat you brought back from your trip. Design a flow network and show how you can use it to efficiently decide whether you can give each friend enough treats without giving anyone more than k of the same type