Seat Availability Checker

Problem Statement

Seat Availability Checker Problem Description A ticket reservation system keeps the numbers of all seats that are still free. A user types the seat number they would like to book, and the system must tell them whether that seat is free. You are given the list of n available seat numbers and the seat number m the user asked for. The list may contain the same seat number more than once; a repeated number simply means that seat is free. The seat m is available if it appears in the list at least once, at any position. Function Description Complete the function checkNumber in the editor below. checkNumber has the following parameters: int seats[n] : the available seat numbers, in the order they are given int m : the seat number the user wants to book Returns: string : "<m> is present!" if m appears in seats , otherwise "<m> is not present!" , where <m> is the value of m Input Format The first line contains an integer n , the number of available seats. The second line conta