S.l in an array Question: Write a sequential algorithm that search a value val in an array arr of size n and return the position pos of the first location where arr [pos] val. (and returns n otherwise.) Question: What is the complexity of this algorithm? (as a function of pos and n) Note that in a parallel algorithm one needs to know in advance the task set, or at least some of the tasks. Therefore, one should not use construct such as break or use a looping condition that varies across the iterations. With that in mind: Question: Can you make a parallel algorithm with (n) work? what is its critical path and width? Question: Can you make a parallel algorithm with 0(pos) work? What is its critical path and width? 3.2 in a linked list Question: What do you think about solving the same problem in a linked list