Use the divide$-$and$-$conquer algorithm to find the maximum sum

subarray of the following:

A $=[-2,1,-3,4,-1,2,1,-5,4,3]$