finding problem. Fill$-$up the rows $5$ and $6$ using the LCS algorithm. You must have to show the answer

in your answer script. Do not write anything on the question paper.

A

$G$

G

a$.$ Consider two strings "AGGTAB" and "GXTXAYB". Find the longest common

subsequence in these two strings using a dynamic programming approach.

b$.$ Run the Graham scan algorithm to compute the convex hull of points below, starting

from.