For this question you will work with an instance of the IntegerStack class, which is an implementation of the Stack interface shown below. puble Interton Back // Manomenat with value to the back Woven the top from the tick and ecure its value le in pop(): I turn the Valo thement at the top of the stack public int top(): / turn the bor on in the stack tointi VE true that otherwise Duble boolopty or Assume all of the methods specried in the Stack Interface have been implemented correctly in the Integer Stack class. There is no sFull method as the implementation allows for an unlimited number of elements to be inserted Complete the implementation of the ternovo All method specited below, which takes a reference to an integeStack and an integer triveshold, and removes all odments from tvo stack with a value greater than threshold. The method retums an integer representing the sum of alles removed. Purpoto cenovo elements found in the tax with We greater than thronto. Neturns the um of the value of all elements removed. Pranent Integer stack - the atack to search through int threshold - the main table valor tenerint - the sum of the value o aillement removed Ponto the are in the order ore the call to removed, with only valer than threshold removed pietate int renoveeritaks, ot threshold) W TOOL this method