An arithmetic array is one whose elements form an arithmetic sequence, in order - i.e., they're arrays of the form A = [a_1, a_1 + c, a_1 + 2c, ..., a_1 + (n - 1)c], where A has length n (for n Greaterthanorequalto 2). You're given an arithmetic array with one element missing from somewhere in the middle (i.e., it's not the first or last element that's been removed). For example, the missing number in [3, 6, 12, 15, 18] is 9. The missing number in [1, 15, 22, 29, 36] is 8. Describe a way to calculate c in constant time. Design an algorithm to efficiently find the missing number in the array. Briefly justify a good asymptotic runtime of your algorithm