In terms of Java data structures

You have a dynamic array with 2 elements in it and a capacity of 3. The capacity doubles when additional space is needed and shrinks by 50% (rounding down) when the size is at or below 50% capacity. You perform the following operations: Add, Add, Remove, Add What will be the capacity of the list after the operations have been performed answer should be a single integer number)? You have a dynamic array with 2 elements in it and a capacity of 3. The capacity doubles when additional space is needed and shrinks by 50% (rounding down) when the size is at or below 1/3 capacity. You perform the following operations: Add, Add, Remove, Remove, Add How many available spots will remain in the list after the operations have been performed (answer should be a single integer number)