need solution to be in Python 2

String Chains Given an array, words, of n word strings (words[O), words[11, , words n-1), choose a word from it and, in each step, remove a single letter from the chosen word if and only if doing so yields another word that is already in the library. Each successive character removal should be performed on the result of the previous removal, and you cannot remove a character if the resulting string is not an element in words (see the Explanation below for detail). The length of a string chain is the maximum number of strings in a chain of successive character removals Complete the longestChain function in your editor. It has 1 parameter: an array of n strings, words, where the value of each element wordsi (where 0 si