A machine cuts N pieces of a pipe. After each cut, each piece of pipe is weighed and its length is measured; these two values are then stored in a matrix with two columns (first the weight and then the length on each row of the matrix). Ignoring units, the weight is supposed to be between 2.1 and 2.3, inclusive, and the length is supposed to be between 10.3 and 10.4, inclusive. Write a script that counts how many rejects there are. A reject is any pipe that has an invalid weight and/or length. For a simple example, if N is 3, the matrix could look like: a. 2.14 b. 10.30 c. 2.32 d. 10.36 e. 2.20 f. 10.45