7- Analyze and evaluate the sequential search as brute force technique, In terms of the following points: 1- Time complexity (Best case, average case and worst case) 2- Implement the codes and trace the output for different examples. 8- Articulate the following main issues related to algorithms design and analysis. A) Time efficiency with appropriate example B) Correctness C) Space efficiency 9- Differentiate between the following algorithm design strategies with appropriate example 1) Brute force 2) Transform and conquer 3) Decrease and conquer 4) Divide and conquer