Implement algorithm below in Python. Python code needed not c and c++

15pts. Given an array of strings, design a divide-and-conquer algorithm that finds the longest common substring that is present at the beginning of all these strings. Example: Input: ["programmable", "programming", "programmer", "programmatic", "programmability"] Output: "programm" Example: Input: ["compute", "compatible", "computer", "compare", "compactness"] Output: "comp