Company: virtusa_15oct
Difficulty: medium
Seat Availability Checker Problem Description In a ticket reservation system, you store the available seat numbers in a TreeSet. Users input their desired seat number, and the program checks whether the chosen seat is available. Using a TreeSet ensures quick and efficient verification of seat availability, ensuring a smooth and organized ticket booking process. Input format: The first line of input contains a single integer n , representing the number of available seats. The second line contains n space-separated integers, representing the available seat numbers. The third line contains an integer m , representing the seat number that needs to be searched. Output format: The output displays " [m] is present! " if the given seat is available. Otherwise, it displays " [m] is not present! " Refer to the sample output for the formatting specifications. Examples Example 1: Input: 4 2 4 5 6 5 Output: 5 is present! Example 2: Input: 10 2 4 6 8 5 9 7 1 2 10 3 Output: 3 is not present! Constrai