) T=y a b b a d a b ba do $ Construct a SA for the string using an O(n) algorithm.) Searching for P=abb in T using just the SA ( using binary search)...

1,a.) T=y a b b a d a b ba do $ Construct a SA for the string using an O(n) algorithm.b.) Searching for P=abb in T using just the SA ( using binary 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)