Complexity O
d) int sum-e; for (int i . 1; i <. N-2; i++) { for (int j-l; j<. í + 4; j++) { sum++ sum++ cout < sum << endl; e) int sum8 for (int i l; i <. N * 2; î++) { for (int j . 1; j<. í / 2; j +-2){ for (intk-e; k<N’N; k++) sum++ cout << sum <<endl;
OR
OR