Please provide detailed step-by-step solutions! Will give thumb-up for a good answer. Thank you!

5. Suppose we want to find the longest common subsequence of two strings, X "hypocentral" and Y-"lycanthrope". Trace the dynamic programming algorithm LCS-Length in Section 15.4 of the Cormen textbook. Then determine which one of the following items has the correct value a) b) c) C1711101=2 c[ 10117]=3 c[10][7] 4