What is the temporal complexity of inserting an element into the middle of an array implemented via ArrayList?

Inserting an element into the middle of an array implemented via ArrayList requires shifting all subsequent elements to the right to make space for the new element. This means that the insertion operation has a time complexity of O(n), where n is the number of elements that need to be shifted. In the worst case (inserting at the beginning), almost all elements of the array are shifted.