subject design and analysis of algorithms please explain the following (A) Represent the time complexities using iteration method for the Linear search, Selection sort and Decrease and Conquer...

subject design and analysis of algorithms

please explain the following

(A)

Represent the time complexities using iteration method for the Linear search, Selection sort and Decrease and Conquer algorithms. Also write down the initial conditions for each

(b)

Explain the working of Kruskal’s and Prim’s graph algorithm with the help of suitable examples.