Please show steps-by-steps detail. Please state which method you used.

a.) T-y a bbadabb ad o $ Construct a SA for the string using an O(n) algorithm. b) Searching for P=abb in T using just the search) (state the big-O for the general case) c.) Search for P-abb using SA and LCP (state the big-O for the general case) d.) Search for P in the tree for T (highlight the leaves and state the big-O for the general case) SA (using binary a.) T-y a bbadabb ad o $ Construct a SA for the string using an O(n) algorithm. b) Searching for P=abb in T using just the search) (state the big-O for the general case) c.) Search for P-abb using SA and LCP (state the big-O for the general case) d.) Search for P in the tree for T (highlight the leaves and state the big-O for the general case) SA (using binary