Q2) For each code segment, state its runtime complexity in terms of N using Big O notation. (assume sum is initially zero in each case) (5 points) a) sum = sum + i; b) for ( int 1-1 ; 0; j ) { sum-sum 1 d) for ( int i = 0; i ; j-) { sum sum +l; e) for ( int i l ;