This is a term project. (a) Consider the following types of constraints that might exist in a software test environment. Prohibited pairs A set of pairs that must not appear in the covering array....

This is a term project. (a) Consider the following types of constraints that might exist in a software test environment. Prohibited pairs A set of pairs that must not appear in the covering array. Prohibited higher order tuples A set of n-order tuples, n > 2, must not appear in a covering array of strength 2. Factor coupling If factor A is set to r then factor B must be set to s, where r and s belong to, respectively, D(A) and D(B). This relationship can be generalized to the following. If X(F1,F2, ... ,Fn) then Y1,Y2, ... ,Ym; n,m ≥ 1. where X is a relation amongst one or more factors and Ys are constraints on factors. For example, a simple relation exists when X ∈ {,≥, =}. Such relations might also exist among more than two factors. Procedure IPO does not consider any factor related constraints while generating a covering design. Rewrite IPO by including the ability to input and satisfy the constraints listed above. You might solve this problem in an incremental fashion. For example, you might start with modifying IPO so that only the Prohibited pairs constraint is included. Then proceed to include the other constraints incrementally. (b) Think of some practical relations that correspond to X above. Include these in the revised IPO. (c) Write a Java applet that implements the revised IPO procedure. (d) If you want to, commercialize your applet and make some money by selling it! watch out for companies that have patented algorithms for the generation of combinatorial designs?