66. If a rectangular street network is r blocks by s blocks, find a formula for the minimum number of edges that must be added to eulerize a graph representing the network in terms of r and s. (Hint: Treat the case separately. Test your formula with the cases 6 blocks by 5 blocks, 6 blocks by 6 blocks, and 5 blocks by 3 blocks.)