1. Consider the following two program fragment: State whether the edge-coverage criterion may lead to different test sets in the two cases. 2. Let f ci) denote the set of all Boolean conditions used in a program P to govern the flow of execution. (For simplicity, we assume that control is driven only by Boolean conditions; for instance, ease statements of Pascal are ruled out.) The edge-coverage criterion requires that a test set f di) must be such that each cl is made true and false by some d3 at least once. For each C1, let D1 and 5, denote, respectively, the sets of input data that cause C1 to be true and false during P's execution. Then the edge-coverage criterion is satisfied by test sets T that must contain at least one element of Di and one element of D1 for each Cr This does not define a partitioning of D, however, Why? As a consequence, there may be different test sets, with different , satisfying the edge-coverage criterion. Thus, the problem arises of finding minimal test sets that satisfy the criterion. For the following fragments, find minimal test sets compatible with the edge-coverage criterion: