Minimum cover - Given two strings A and B a minimum cover of A by B is a decomposition of A into substringgs of B such that k is minimum, here k is the number of substrings of B that covers the entire string A and k has to be minimal. In other words , minimum cover of A by B expresses string A as a concatenation of the fewest possible substrings of B, where these substrings can come from anywhere in B. if length of string A is m and of strign B is n, find the minimum cover in O( (m+n) log(m+n)) time. Use suffix array and its lcp array.