Please ans this question in your own word.

1. a.) T-y a bbadabbado S 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) 1. a.) T-y a bbadabbado S 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)