Determine the longest path through each code fragment, assuming that all statements can be executed in equal time and that all branch directions are equally probable.

Transcribed Image Text:

a. if (i < CONST1) {x a+b; } else {x c-d; y-e+f; } b. for (i=0; i < 32; i++) - if (a[i] CONST5) { w-r+t; x-r s y-s+u;