function example (n) count = 0 for 1=1 to n do for J=0 to I do for k=) to J+I do count = count + 1 endfor endfor endfor return (count) end What is the worst-case complexity of this algorithm? Some equations you may need: n(n+1)(2n+1) 6 1 k2 Ex=1k3 m2 (n+1) 4 n(n+1)(n+2) k-1 k(k+1) Select one: n(n+1)(n+2) a. W(n) 3 O b. W(n) = 2n3 +3n2-5n 6 O c.W(n) n-7n+6 3 O d. W(n) 2n3 +9n2 +13n 6