Please answer all.

1-What is the difference between an array list's size and its capacity? Can one be larger than the other?

2-An element can be inserted at the beginning, middle, or end of an array list. Which of the three insertion points is the most computationally expensive, and why?

3-When you read about the simple ArrayIntList class, you saw that the class had public methods called size (to read the number of elements in the list) and get (to access the element value at a specific index). Why is this approach better than declaring the fields (such as size) public?