Answer Happy

Design and analysis of algorithm
Consider the following pseudocode, procedure find (list, value) for each item in the list if match item == value return the item's location end if end for end procedure 1. Clearly describe the input taken by the algorithm and the output returned by the algorithm. Compute the Time Complexity of the above pseudocode using Theta or BigOh notation. [5m] 2. Write another algorithm “TRIAL" with a different technique, for the same task as accomplished in the above pseudocode and analyse its complexity. [5m] [NOTE: You have the flexibility to either modify or propose a new strategy] to check your submission