Classroom Seating Arrangement

Problem Statement

Classroom Seating Arrangement In a classroom, there are N seats numbered 1 to N, and N students are present. Each student, starting from student 1, has a preferred seat represented in an array A. The students enter the classroom one by one and attempt to sit in their preferred seats. If their preferred seat is already occupied, they begin searching for the next available seat in a circular manner. Your task is to find and return an integer array representing the order in which the seats will get occupied according to their attempts to sit in their preferred seat. Note: Initially all the seats are empty. \"Circular\" means that if a student\'s preferred seat is already occupied, they start traversing the seats for the next available seat till the N th seat and then loop around to the beginning of the seating arrangement. Input Format input1 : An integer value N, representing the total number of seats present. input2 : An integer array A, representing preferred seats of students. Output