Write a program to help the company cover a room with the fewest pieces of carpet needed. The carpet squares all measure an integer number of feet on each edge, and only accepts jobs for rooms with both width (W) and length (L) in integer number of feet. Obviously if a room is perfectly square, the company can finish the job with a single piece of carpet, and the maximum number of carpet squares that would ever be needed is L x W squares, each 1-foot on a side in java.