(Solved) : B 8 Points Suppose Registers Data Memory Initial Values Shown Simplicity Values Shown Dec Q30073930 . . . .

<p><img alt="7. What is the big-O performance estimate of the following function? int f (n) [ int sum 0; for (i = n; i > 0; 1--) return sum //

<p>For the following question, refer to the Scatterplot Figure atthe end of the exam</p><p>a. How many total bits are represented by the four receivedsignals in the diagram?</p><p>b. How many levels

see attachment for all requirements. There are 5 questions 100+ words for each question and should be paragraph for each question. plus a reference page at the end