Please help me with //b) and //c) Thanks!

bigohl o Languagerrype: Related Links: C++ algorithm analysis Wjkjpedia: Big-Qh sum cout int sum sum Give a tight bound of the nearest runtime complexity class for each of the following code fragments in Big-Oh notation, in terms of the variable N. In other words, write the code's growth rate as N grows. Write a simple expression that gives only a power of N using a caret character for exponentiation, such as to represent O(rva) or O(log N) to represent O(log2 M). Do not write an exact calculation of the runtime such as O(2tva + 4N+ 14). for (int i for (int cout sum int sum N; for (int i = Z; endl ; endl ; N; N; N; endl ; answer: o (c) answer: o (c) 1 ; for for for cout (int sum (int sum (int sum sum