THIS QUESTION MUST BE ANSWERED WITH CLEAR ENGLISH PSEUDOCODE! You have N items for sale, numbered from 1 to N. Alice is willing to pay alil> 0 dollars for item i, and Bob is willing to pay bi]>0 dollars for item i. Alice is willing to buy no more than A of your items, and Bob is willing to buy no more than B of your items. Additionally, you must sell each item to either Alice or Bob, but not both, so you may assume that N s A+B. Given NA,B,a1..N] and b[1..N], show that you can determine the maximum total amount of money you can earn in O(N log N) time. Hint: Suppose N- A B and pretend you wish to sell all items to Alice, but must choose B of them to give to Bob instead. Which ones do you want to give to Bob first? Then extend your approach to handle N