Given s set of n numbers A = [a1, a2, a3,..., an] we want to compute the all sums of the form a1, a1+a2, a1+a2+a3, a1+a2+a3+a4,... a1+a2+...an. I. Describe a sequential algorithm that accept the A array and produce an array S where S[i]=a1+a2+...ai. Provide detailed explanation and illustrative figure for your algorithm. II. Compute the time complexity of you proposed sequential algorithm. III. Assuming we have P processor, propose a parallel algorithm for this problem. Provide detailed explanation and illustrative figure for your algorithm with a fixed P value (for example P=4) and sample input set. IV. Compute the time complexity of you proposed parallel algorithm. V. How much the parallel algorithm is faster than the sequential algorithm. Week 3 Discussion: Geek Squad Must post first. Watch the Geek Squad Case Video Be sure to answer and respond to all three questions! Q1: What are the key environmental factors that created an opportunity for Robert Stephens to start the Geek Squad? Q2: What changes in the purchasing patterns of (a) all consumers and (b) women made the acquisition of Geek Squad particularly important for Best Buy? Q3: Based on the case information and what you know about consumer electronics, conduct an environmental scan for Geek Squad to identify key trends. For each of the five environmental forces (social, economic, technological, competitive, and regulatory), identify trends likely to influence Geek Squad in the near future.