Answer Happy

please type clearly
Question 3 (11 points) Fill in the following table with the order of growth of the indicated operations for the given implementation approach-assume the list holds N elements: operation add get contains remove isEmpty indexed add indexed set indexOf indexed get iterator next iterator remove ABList LBList Question 4 (8 points) Design an algorithm for an application-level method last that accepts a String list as an argument and returns a String. If the list is empty, the method returns null. Otherwise, it returns the last element of the list. The signature for the method should be: String last(ListInterface<String> list)