Please provide the answers in this way

Problem -> Ideas -> Mathematical formulation -> Mathematical analysis -> Plain English algorithm -> Pseudocode -> Code

If you write code please do it in java and provide a detailed explanation of the answer and the complexity. The explanation is the most important aspect

function MyMax(array A[1..n]) if n =-1 then return A[1 end if if n == 2 then return max(AI1], A[2]) end if empty array for i from 1 to [n / 3 do append max(A[3i - 2], A[3i - 1], A[3i) to B end for if n mod 3 = 1 then append A[n] to B end if if n mod 3 = 2 then append max(A[n], A[n - 1]) to B end if return MyMax(B) end function [n/3 stands for the floor of n/3, for which an alternative mathematical notation is |n/3] Find a -expression for the number of operations performed by the algorithm in terms of n