The diagram below corresponds to a 100-lme; high-level language program with a single loop that can be
executed no more than 20 times.

If this program was exhaustively tested, approximately how many possible paths would be executed0
Show answer and explanation
Correct answer: D