The SEQUENCE-ALIGNMENT problem gives us two strings and asks if there is an alignment that optimizes an objective function. (a) (4 pts) Give a nave, brute-force algorithm to solve the problem and describe its runtime. (b) (6 pts) Given stringi = ALGO and string2 = TEST, and suppose the gap penalty 8 = 1 and the alignment costs are C(x, y) = 1 (x + y). 1. What is the optimal alignment? 2. What is the cost of the optimal alignment?