Answer the following questions about the LCS3 problem. In the LCS3 problem, you are given three strings (str1, str2, and str3, of length 11, 12, and 13, respectively), and you need to compute the length of the longest string that is a subsequence of all three strings. For example, if str1 = garbage, str2 = bogarted, and str3 = gear, then LCS3 would be "gar. It can be shown that the LCS3 satisfies the recurrence below, where i, j, and k represent the current position in str1, str2, and str3, respectively. LC53(i,j,k)= ifi = 11+1, or j = 12 +1, or k = 13+1 (1+LCS3(i +1.) +1,2+1), if str1[1] = str2[j] = str3[k] (LCS3(i +1.j,k), max/LCS3(i j +1,k), otherwise (LCS3(ij, k +1)