java lang task1

Aurinn w Lab Arraylsts and Trees - Word Search Xoral Xdial Fle Home Insert Design Layout References Malings Review View Help Share Comments X Cut A 27 2 Find - 4. Ari Body CS) 14 AA A A A BI DAA COM Anbcc AaBbccc CEDE AaBbcc AoB6CD AaBbCal. AaBbce Ab BbcDc AsBbcc Aabbcc 1 Console. 1 Lab Hou. Lab Figu.. 1 Lab Goal 1 Lab Goal. 1 Lab Rub. Lab Rub. 1 Lab Rub. 1 Lab Solu. 1 Lab Solu.. 1 Labas == - Sensitivi dhor Format Panter Clipboard rent Paragraph Editing Voir Editor CS 143 Lab 6: Lists Stored as Arrays, Trees Winter 2021 Objective: In this lob you will practice the following skills: Identify ArrayList operations Identify properties of trees and binary trees Create tree data structures in lava Implement tre traversal in different orders You will also reinforce your knowledge in stacks and priority queues Task 1. Lists Stored as Arrays (5 points) 1.1. Which ADT operation corresponds to AL2] - 5? setA(2,5) set (A, 2, 5) set(5,2,A) A.set(2,5) 1.2. Which ADT operation corresponds tox - A[3]? 58X (4,3} X = A.get (3) X.get (3) = A 1.3. In your own words: if a list is stored as an array, why is adding an item in the middle of the list slow? In your own words: if a list is stored as an array, why is removing an item from the middle of the list slow? 1.5. If a list is stored as an array, and the list grows biarer than the array size, how might the program respond? (Choose two A Throw an exception B. Create a new array twice as big as the old one and copy the values over C Create a new array one hundred elements larger than the old one and copy the values over D. Return an error Page 1091313 words DR Talline Ste Erar TI - 120 12095