Solution --- for the minimum area, multiply the smallest board size by the sum of all the others, and for the maximum --- solve the knapsack problem (selecting boards so that the dimensions are closer to a square). It can be solved by complete enumeration.