Give an O(n2)-time algorithm for the previous problem. Given a string X of length n and a string Y of length m, describe an O(n+ m)-time algorithm for finding the longest prefix of X that is a...

Give an
O(n2)-time algorithm for the previous problem.

Given a string
X
of length
n
and a string
Y
of length
m, describe an
O(n+

m)-time algorithm for finding the longest prefix of
X
that is a suffix of
Y.

Give an efficient algorithm for deleting a string from a standard trie and

analyze its running time.

Give an efficient algorithm for deleting a string from a compressed trie

and analyze its running time.