a. Implement the same pseudo code shown in the picture below using C++ language. b. Show the output for at least 2 test cases. c. What is the time complexity of the code? why? d. Write your observation about the code.

LCS-LENGTH (X,Y) 1 m F X. length 2 n Y. length 3 let m 1 ..n] and CU..m, n be new tables 4 for i 1 to m 6 for j 0 to n 7 10, 0 8 for i 1 to m for j 1 to n 10 if xi c[i, j] [i -1 1] 1 b[i, j] 12 elseif cli 1, j]2 cli, j -1] 13 14 b[i, j] "t'' 15 16 else cli, j] c i, j ij b[i, j] 17 18 return c and b