What's the worst-case running time of the following code? Show how you came about your answer.

a)

for ( i=0; i< n * n ; ++i ) {

linearTimeFunction ( n )

}

b)

for ( i=0; i

constantTimeFunction( n )

linearTimeFunction ( n )

cubicTimeFunction ( n )

}