Given an array of strings, design a divide-and-conquer algorithm that finds the longest commonsubstring 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

Whenever you are asked to design an algorithm, implement your solution inPython3. Write a driver function to test each of these algorithms. Inputs shouldbe randomly generated (by usingrandomlibrary) or taken from the user (you mayassume that the inputs are proper)