Assignment 2: Dynamic Programming Overview In this assignment, you will practice dynamic programming by solving two programming exercises. First Exercise: This is an application from the field of computational biology. This exercise provides a lot of hand-holding regarding how to implement the dynamic programming algorithm. The goal is for you to learn about a real-world application and to practice implementing dynamic programming solutions. Second Exercise (optional): This is a hypothetical application for which you have to think of a dynamic programming solution from scratch. Less help is provided on how to design and implement the solution. Post Assignment Questions: These are non- programming questions about your implementation for the two exercises. Assignment 2: Dynamic Programming First exercise. This is an application from the field of computational biology. This exercise provides a lot of hand- holding regarding how to implement the dynamic programming algorithm. The goal is for you to learn about a real-world application and to practice implementing dynamic programming solutions. Second Exercise (optional): This is a hypothetical application for which you have to think of a dynamic programming solution from scratch. Less help is provided on how to design and implement the solution. Post Assignment Questions: These are non-programming questions about your implementation for the two exercises. i Note that you are allowed to submit as many times as you like before the deadline. Each time you submit a programming exercise, you will receive automatic feedback from the system regarding the correctness (and potentially the running time of your code). Your code is expected to compile and run. Code that does not run will not receive any credit. Grading [98%] DNA Sequencing o [70%] Implementation of function edit_distance o [28%] Implementation of function align. [2] Reflection [bonus: +50%] Election Billboards o [+40%] Implementation of function max_exposure [+10%] Implementation of function best_billboards + 6 dna.cpp Et .test.cpp 1 #include "dna.cpp" 2 #include 3 #include 4 using namespace std; 5 6 int main(int argc, char *argv[]) { 7 8 string A, B; 9 cin >> A >> B; 10 11 string arg = argv[i]; 12 if (arg.compare ("edit") == 0) 13 cout 2 #include 3 using namespace std; 4 5 int edit_distance(string A, string B) { 6 return 0; 7 } 8 9 void align(string A, string B) { 10 cout