Complete the following program in C, please.
Problem 1 (48 points): You won a travel grant in three installments of $400 each. The aim of the grant is to travel to as many inns as possible in Key West and not run over budget. You can choose which inns to visit with each installment of the grant. Since you can only spend $400 per travel, you must figure out which inns to visit on each travel but must visit them all. The prices of the inns are provided below on the Key West map, but your code must work with any such map (i.e. no hardcoding of results!)
Travel 1: $214, $149
Travel 2: $157, $104, $121
Travel 3: $127, $128, $101
Doing so leaves you with some money left over that you can donate to charity. There are other possible arrangements that also fit the three travels, but it cannot be done with fewer.
This one is tricky, and we expect you will mull over it for a while before you have a solution. By the way -- the solution must be recursive. Otherwise, you will not enjoy the travel!