calculating cyclometric complexity using Control Flow Graphs.

Given the following fragment of code how many test cases are required for 100% decision coverage?

Give the test cases?   

if width>length

then biggest_dimension=width if height>width

then biggest_dimension=height end_if

else biggest dimension=length if height>length

then biggest_dimension=height end_if

end_if

Cyclometric complexity=number of regions=4(3+1)

                                          =number of predicates+1=3+1

                            E-V+2=     12-10+2 = 4

Number of test cases required for 100% decision coverage are 4

statement coverage, decision coverage, branch coverage, control flow graphs, program graphs, dd graphs, du,dl, slices, decision tables slices dices , independent paths