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 X. length 2 n Y. length 3 let bli m, 1.. n] and c [0 m, 0 nl be new tables 4 for i 1 to m 6 for j 0 to n 8 for 1 to m for j 1 to n 10 if x 11 cli, j] [i 1 12 bli, jl elseif cli 1, j] z cli, j 1] 14 cli, j] 1, j] Cli bli, jl "t'' 16 else cli, j] cli, j -1] bli, jl 17 18 return c and b