Problem

1. Give a mathematical definition of how the input output specification of a program may be transformed into a Boolean (unction, as required by the cause effect graph technique. State when this approach is ineffective and when it is not applicable at all.

2. Give an example of testing boundary conditions in black-box testing.

3. Sometimes, your stub can use existing facilities available, for example, from the operating system. Explain how to use the sort package available on most systems in the stub just dis-cussed. If you can use the sort package in your stub, why not use it in the final product?