* Analyze time complexity for a given algorithm (written in pseudo-code) (a) x = 0; y = 1; for( i = 0; i < n; i++ ) for( j = 0; j < n; j++ ) x++; y = x * x; (b) x = 0; for( i = 0; i < n; i++ ) for( j = 0; j < n * n; j++ ) x++; (c) x = 0; for( i = 0; i < 2 * n; i++ ) for( j = 0; j < 3 * i; j++ ) x++; (d) x = 0; for( i = 1; i < n; i++ ) for( j = 0; j < i * log i; j++ ) x++; (e) x = 0; i = 1; while( i < n ) { i = 2 * i; x++; } (f) algorithm Test(A[1..n]); for i := 1 to ... for j := 1 to ... while .... call Test(A[i..j]);