a.) T=y a b b a d a b b a d o $ Construct a Suffix Array for the string using an O(n) algorithm.

b.) Searching for P=abb in T using just the Suffix Array ( using binary search) (state the big-O for the general case)

c.) Search for P=abb using Suffix Array and LCP array Construction (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)