This option is to develop an algorithm that would find an optimal pattern to seat guests in a nn × mm theatre where n is the number of rows and m is the number of seats. Challenge parameters • Choose to work in metric or English units. • Data set, input from user: o Number of rows o Number of seats o Distance between seats in inches/meters  When you prompt for input, make sure you tell the user if you want inches or meters o Distance between rows inches/meters  (you can consider this to be center of the seat to center of the seat). • Each person must be a minimum of 6 feet (per USA) or 1.5 meters (per Germany) from another person.