exercises for help with exercisesplease visit the sitewww wiley com/college/goodrich reinforcement - julia just bought new computer that uses -bit integers to address memory cells argue why julia will never in her life be able to upgrade the main memory of her computer so that it is the maximum-size possibleassuming that you have to have distinct atoms to represent different bits - describein detailalgorithms for adding an item toor deleting an item froman (abtree - suppose is multiway tree in which each internal node has at least five and at most eight children for what values of and is valid (abtreer- for what values of is the tree of the previous exercise an order- -treer- consider an initially empty memory cache consisting of four pages how many page misses does the lru algorithm incur on the following page request sequence( ) - consider an initially empty memory cache consisting of four pages how many page misses does the fifo algorithm incur on the following page request sequence( ) - consider an initially empty memory cache consisting of four pages what is the maximum number of page misses that the random algorithm incurs on the following page request sequence( )show all of the random choices the algorithm made in this case - draw the result of insertinginto an initially empty order- -treeentries with keys ( )in this order creativity - describe an efficient external-memory algorithm for removing all the duplicate entries in an array list of size - describe an external-memory data structure to implement the stack adt so that the total number of disk transfers needed to process sequence of push and pop operations is ( /