Determine the shortest path through each code fragment, assuming that all statements can be executed in equal time and that all branch directions are equally probable. The first branch is always taken.

a. if (a >0) x=5; else { if (b < 0) b. if (a b) { if (c> d) x=7; x-1: else x-2;