Algorithm design and analysis

1. Implement one of the algorithms you studied in class in a language of your choice. The problem should be one of those covered while discussing DIVIDE AND CONQUER, GREEDY and DYNAMIC PROGRAMMING design techniques. For example, you may choose one of the following: Coin Change, Minimum Spanning Tree (either Prim or Kruskal), Single Source Shortest Path, Hoffman Coding, Tower of Hanoi, Fibonacci Numbers, Polynomial Coefficients, and Bracket association in Matrix Multiplication 2. Implement the FFT algorithm for multiplying large integers You should submit a report with the following included Describe basic concepts and Technical Report Students are required to submit a technical algorithms design and analysis. on Efficient report containing the following implementation of algorithms demonstrate an acceptable ability to analyze algorithms time and space efficiency I. a computer implementation of a number of problems covering the areas: Divide and Conqer Dynamic Programming, and Greedy algorithms. nstrate a good grasp of Evidence that the implemented the factors involved in the design of efficient algorithms. programs performs the required tasks correctly