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 anyother PE in three time units $($independent of the size of the data$).$ It is considered asthree seconds.$$ Input and output $-$ At the beginning of the program, the whole input array A is stored inPE #$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.