What is the Big-O running time of the following code that empty a list and explain your answer? [10 Points] If list1 implemented as ArrayList. b. If list1 implemented as Linked List. public static void empty (List list1) { } a. Iterator itrl = listl.iterator (); while (itrl.hasNext ()) { Integer x = itrl.next(); itrl.remove();