Consider the following code segment. Regardless of what it does, show in details how you conduct performance analyze to determine best case scenario function, worst case scenario function, and average performance function F(n). The algorithm performance is characterized/measured by assignment statements, print statements, comparisons, and swaps. Note that a call to function SWAP and System.out.print is counted 1 operation Finally, from F(n) determine Order of Magnitude (Big-O). Giving only the final Big-O answer receives limited small points, show how you count operations. 1 2 2 3 for (int i = 0; i 100){ swap (a[i], 100); } 5 6 17 8 9 10 for(int j=0; j<>