Can someone please provide me the correct answer of this question. For the recursive case, I need to write all algorithms without any loops.

1. (3.1.4) Consider the largest difference between consecutive elements in a finite sequence of integers. For example, given the sequence: (8,2,9,5,1) ...the largest difference between consecutive elements is 29=7. Give pseudocode for a recursive algorithm that finds the largest difference between consecutive elements in a sequence