Need help on question 4, solving it using Master Theorem

For the following problems stated as pseudo-code, let Ale...r] denote the sublist of the integer list A from the l-th to the r-th element inclusive, let Quad (A[1 n]) denote an algorithm that runs in time (n2), and let Flash (A[1n]) denote an algorithm that runs in time nlogloglog n Bar (Al1.. n]) If nsl Then Return // nothing to do Bar (A[1...-31) Flash (A[1 n]) End Bar (2 points) 3. State a recurrence that gives the complexity T(n) for algorithm Bar. 4 points) 4. Find the tight complexity of algorithm Bar