The program starts with the source collectData()

Hello! I need some assistance in figuring out how to implement this algorithm and export to .csv format for plotting the data. I do not understand how to implement the algorithm described to obtain time complexity...all the instructions are provided below. You do not need to plot the data, I can do that myself. I just need assistance with the code for the algorithm!

I only need help with #1 ! So, just the code for plotting the data. DO NOT post snapshots of lined paper with answers. I'm ONLY looking for the code for this algorithm to implement.

What you need to do: 1. Implement a silly (nave and inefficient) algorithm A to compute the sum 21 ax' where where a and x are a real numbers with OSX S1. 2. Collect the execution time T(n) of algorithm A as a function of n Objective: The objective of this programming assignment is to implement in your preferred language an algorithm A to compute the sum Ei=1 ax' where a and x are a real numbers (0 SX S1). We are interested in exploring the relationship between the time complexity and the "real time (wall time). For this exploration, you will collect the execution time T(n) of Algorithm A as a function of n and plot T(m), 7(a), on different nin(n) graphs. Finally, discuss your results: use the plots you will build to determine and justify the time complexity of T(n). Tanan, and 7(n) Algorithm A ComputeSumBowers (mm) inputs: x is a real number with 0