Please show all of your work. I have included the references to the given algorithms below:

P-4.60 Perform an experimental analysis of the two algorithms prefixAveragel and pre- fixAverage2, from Section 4.3.3. Visualize their running times as a function of the input size with a log-log chart. 176 Chapter 4. Algorithm Analysis A Quadratic-Time Algorithm Our first algorithm for computing prefix averages, denoted as prefixAveragel, is shown in Code Fragment 4.9. It computes each element a; independently, using an inner loop to compute that partial sum. 4 6 7 8 9 10 1 /** Returns an array a such that, for all j, a[i] equals the average of x[0], ..., x[i]. */ 2 public static double[ ] prefixAveragel (double[ ] x) { 3int n = x.length; double[ ] a = new double[n]; // filled with zeros by default 5 for (int j=0; j<>