(Grading details: correct answer=15. empty=0, wrong answer=-5) function example (L[1:n]) Input: L[1:n) (a vector of integers of size n) Output: A value m m=0 for 1 = 1 to n do for J= 1+1 to n+1 do for K = 1+1 to J do m = m + L[K] endfor endfor endfor return m end What is the worst-case complexity of this algorithm? Some equations you may need: n(n+1)(2n+1) ak1 6 n(n+1)(n+2) 3 1 k(k+1) Select one O a. W(n) T: +5? O b. W(n) OcW(n) T-311+2n d. W(n) +2+372 +2n 6