4. Describe efficient algorithms for the following variants of the text segmen tation problem. Assume that you have a subroutine IsWorD that takes an array of characters as input and returns True if and only if that string is a “word”. Analyze your algorithms by bounding the number of calls to IsWORD. (a) Given an array All.n] of characters, compute the number of partitions of A into words. For example, given the string ARTISTOIL, your algorithm should
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured