Code should be written in Python.

Problem Statement A health club chain allows its members to visit any of its many health club locations an unlimited number of times per day. The only constraining rule is, a customer can only visit one health club location per day, even though he or she may return to that location an ulimited number of times for the rest of that day. Although the honor system has always worked quite well the club wants to run some tests to see how many people rules. You are to write a program that takes the entrance log files from three different clubsa logging the same day) and return a sorted list of the people who are not honest and went to more than one health club location n the same day. The log files are represented as lists of Strings where each element is the member name of a customer who entered that day. For example, if a customer showed up three times to one of the club locations that day, the members name would appear three times in the corresponding list of Strings Notes: really follow the clubl, club2, and club3 may contain a different number of elements. . The same member name can appear multiple times in a single log file The elements of the returned String list should be sorted in lexicographic order (the order they would appear in a dictionary) Assume that two people with the same name are in fact the same person. Constraints: e clubl, club2, and club3 each have between 1 and 50 elements, inclusive Each element of club club2, and club3 contains between1 and 50 characters, inclusive . Each element of clubclub2, and club3 consists only of uppercase let- ters (A-Z)