As implemented in our textbook: Suppose list1 is a MyArrayList and list2 is a MyLinkedList. Both contains 1 million double values. Analyze the following code: // A: while (list1.size() > 0) list1.remove(); // B: while (list2.size() > 0) list2.remove(); O Code fragment A runs faster than code fragment B. Code fragment B runs faster than code fragment A. Code fragments A and B should run at about the same speed (based on Big-O analysis). Both contain logic errors because they produce infinite loops