Write down a function representing the approximate running time of the following algorithm. Leave it in summation form (by which I mean, you do not have to simplify at all). FUNCTION Looperific(n) x = 0 FOR i + n TO 2n(n3 - n) DO FOR 1 + 1 TO n/2 DO FOR K + i TO 1.j x + x + RETURN(X) Upload Choose a File