Let n > 3. Consider the following pseudocode segment. for E {1, 2, n - 3}...

Transcribed Image Text:

Let n > 3. Consider the following pseudocode segment. for ¡E {1, 2, n - 3} do rw<w+z + 10 for je {1, 2, ..., n} do z+y + y + y + 30 for K € {1, 2, r n²} do for /E {1, 2,..., n} do y + x + 1 for mE {1, 2, ..., n} do x+w+y+z How many "+" operations does this algorithm perform? LL Let n > 3. Consider the following pseudocode segment. for ¡E {1, 2, n - 3} do rw<w+z + 10 for je {1, 2, ..., n} do z+y + y + y + 30 for K € {1, 2, r n²} do for /E {1, 2,..., n} do y + x + 1 for mE {1, 2, ..., n} do x+w+y+z How many "+" operations does this algorithm perform? LL