DESCRIPTION: you are trying to compute summation ( [] 1 =0 ) with a parallel processing method. Determine the total run time and speedup, and efficiency when you use eight processors (PEs). Input: Array A of n numbers (n = 2048) Output: [] 1 =0 Task: Parallelize this problem efficiently using an array of processing elements (PEs) Assumptions: Computation - Each PE can add two numbers stored in its local memory in one time unit. It is considered as one second. Communication - A PE can send data from its local memory to the local memory of any other PE in two time units (independent of the size of the data). It is considered as two seconds. Input and output - At the beginning of the program, the whole input array A is stored in PE #0. At the end the result should be gathered in PE #0. Synchronization - All PEs operate in a lock-step manner; i.e., they can either compute, communicate, or be idle. CAUTION: For this assignment, you need to provide step-by-step drawings with explanations. If you do not submit the drawings with explanations, a huge point deduction will be applied. Please note that you must work with eight processors (PEs). If you use different numbers of processors, you will get a zero score. You must not copy someones work (turns to zero score). SUBMISSION: You can complete this assignment using scratch papers (one or more) or a word document. If you use the scratch papers, take pictures of your work (with your camera) and submit them (CAUTION: blurred pictures might get penalty points). You must submit your work on Blackboard. Assignment step-by-step guideline 40%) Creating step-by-step drawings of how each processor works 30%) Providing explanations about each drawing 30%) Providing total run time and speedup, and efficienc