MATH 2306 Lecture Notes - Lecture 6: Jansky

57. Line 5 (A) for (int j = -i*2; j<= i*2; j++){ (B) for (int j = 0; j< i+2+1; j++){ (C) for (int j = -i; j> i; j++) { (D) for (int j = 0; j<= i*2; j++){ (E) for (int j = i; j<= i+2; j+i) {

Use strokes' theorem to evaluate F(x,y,z)=<z^2,x^2,y^2> where S is bounded by graph z=y^2, 0<x<12, 0<y<12

My attempt: I found curlF but I don't know what to use for "N".