Seat reservation

Problem Statement

Seat reservation Problem Description A movie theater has N seats numbered 1 to N . Build a seat reservation system that performs one of the following operations K times: Fetches the smallest-numbered unreserved seat then reserves it and returns its number. Cancels a seat reservation for seat[i] . The result should be an array containing the reserved seat numbers. Notes If seat[i] = 0 , reserve the seat If seat[i] > 0 , cancel the reservation of a seat Every time we reserve a seat, it is guaranteed that there is an unreserved seat Every time we cancel the reservation of a seat, it is guaranteed that the seat is reserved Function Description Complete the function solution() provided in the editor. The function takes the following 3 parameters and returns the solution: N : Represents the number of seats K : Represents the number of operations seat : Represents the details of operations Input format for custom testing Note: Use this input format if you are testing against custom input or w