Please use python!

Write a divide$-$and$-$conquer algorithm that finds the maximum difference between any two elements of a given array of $($n$)$ numbers $($not necessarily distinct$)$ inO$($n$)$ time. For example, on input A $=14\mathrm{.}5,10,-2,3\mathrm{.}14,-7\mathrm{.}115],$ your algorithm should return $(17\mathrm{.}115).$ Justify briefly that your algorithm is correct and runs within the required time bound. $($For your reference, the Master Theorem states that a recurrence of the form T$($n$)=$ aT $($n$/$b$)+0($nd$)$ has a solution $($nd$)$ if asbd, olnd log n$)$ if a$=$bd$,$ and o $($nlogba$)$ if a$>$bdNote: For full marks, your answer must make use of the divide$-$and$-$conquer method. Partial marks will be given for an On log n$)$ divide$-$and$-$conquer method.