turn the player with the most money must give half of his/her money to the player with the least amount of money what data structure(sshould be used to play this game efficientlywhycreativity - an online computer system for trading stock needs to process orders of the form "buy shares at $ eachor "sell shares at $ each buy order for $ can only be processed if there is an existing sell order with price $ such that < likewisea sell order for $ can only be processed if there is an existing buy order with price $ such that < if buy or sell order is entered but cannot be processedit must wait for future order that allows it to be processed describe scheme that allows for buy and sell orders to be entered in (logntimeindependent of whether or not they can be immediately processed - extend solution to the previous problem so that users are allowed to update the prices for their buy or sell orders that have yet to be processed - write comparator for nonnegative integers that determines order based on the number of ' in each integer' binary expansionso that if the number of ' in the binary representation of is less than the number of ' in the binary representation of - show how to implement the stack adt using only priority queue and one additional integer instance variable - show how to implement the (standardqueue adt using only priority queue and one additional integer instance variable - describe in detail an implementation of priority queue based on sorted array show that this implementation achieves ( time for operations min and removemin and (ntime for operation insert -