State the approximate worst-case running time for each of the following. If you are unsure of one of the calls into the Java Platform APIs, think about how the method might be implemented, and/or read its documentation.

Appropriate answers are of the form constant time or [X] in [Y], where [X] might be linear, quadratic, or the like, and [Y] is the name of the variable or quantity in question. For example, a traversal of an array is linear in the length of the array; if the array is named a, it is linear in a.length.

A. void reverse(int[] a) {

for (int front = 0; front < a.length / 2; front++) {

int rear = a.length - 1 - front;

int t = a[front];

a[front] = a[rear];

a[rear] = t; } }

B.int allPairsProductSum(int[] a) {

int result = 0; for (int i: a) {

for (int j: a) {

result += i * j;} }

 return result;}

C. ArrayList(Collection c) (that is, the copy constructor for ArrayList)

D. ArrayList.size

E. Arrays.binarySearch (Hint: maybe Google for binary search

please answer the question in the correct form Thank you!!!!!