Need help on number 4, using Master Theorem

I ended up with the Big Omega case, but I can't solve for a value of k

For the following problems stated as pseudo-code, let Ale...rl denote the sublist of the integer list A from the C-th to the r-th element inclusive, let Quad (A..) denote an algorithm that runs in time (n2), and let Flash (A[1 n]) denote an algorithm that runs in time eVnlogloglog n) Foo(An]) If ns2 Then Return // nothing to do Quad (An) Foo(All 1 1) Foo(All .. nl) Quad (A.nl) End Foo (2 points). State a recurrence that gives the complexity T(n) for algorithm Foo. (2 points) 2. Find the tight complexity of algorithm Foo. Bar (Al1.. n) If nsl Then Return // nothing to do Bar(A Flash(A..nl) 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