The figure below describes a database about bands and their tours. A tour consists of a sequence of cities visited by a band. We assume that no city is visited twice on a single tour, and on one date, a band can visit only one city. Some of the entity sets are weak, and some of the relationships are supporting many-one relationships, but all double rectangles and double diamonds are not shown. 1. Your task is to decide which of the entity sets are weak, and which relationships support them. If there is a choice, prefer to use the attributes of the entity set itself in the key, and minimize the number of supporting relationships. There may be more than one reasonable answer, especially since "tour#" can have several reasonable interpretations. city Name date bandName Cities At Stops Bands In On By States Tours stateName tourNumber