solve a$,$b both problem

a$.$ Consider two strings "AGGTAB" and "GXTXAYB". Find the longest common subsequence in these two strings using a dynamic programming approach.

$8$

b$.$ Run the Graham scan algorithm to compute the convex hull of points below, starting from $-.-.....$m ancwer in each step.

$7$