Consider N points on a line, whose x-coordinates are stored in an array A in increasing order of their values. Give (in details) an algorithm to determine the largest distance between any pair of adjacent points. Derive the time complexity of your algorithm in terms of N. Ex. If the points are as shown in the example, then the algorithm should return 9. 10 11 16 19 26 30 TTTF Paragraph, Arial %DOQE fx Mashups - 16 3 (12pt) E- E - T- T TS T - - - BEBE I HTML CSS Path:p Words:0