Find the longest common subsequence of the strings AWFUL and WAFFLE. Show the dynamic programming table that you use to find the solution. Include arrows to show how you extract the solution from the table. Recall that the optimal substructure of the longest common subsequence problem gives the recursive formula fo c[i, j] = {c[i-1, j-1]+1 max(c[i,j-1]c[i-1.j]) 0 1 2 Im 3 4 5 j Xi A W F CI U L 0 Yj 1 W if i=0 or j = 0 if i, j>0 and x, = y; if i, j> 0 and x, y, 2 A What is the longest common subsequence? 3 F 4 F 5 L 6 E Identify three important characteristics of any dynamic programming algorithm that are illustrated by this algorithm.