What is the big-Oh time estimate of the following method in terms of n, the length of a? Use the “light bulb pattern” method of Section 14.7 to visualize your result.

public static void swap (int[] a) { int i = 0; int ja.length - 1; while (i < j) { int temp a[i]; a[i]=a[j]; a[j] = temp; i++; j--; }