in to find whether a given string is a palindrome or not. kids to form a chain by holding their hands. Theri school filled with ' n ' kids. The instructor, Mrs. Tina wants to conduct a game and instructs all the kid to their right except the first and last kids). Mrs. Tina then starts the game other's hands and form a chain (each kid has 1kid to their left and one "i", kids must reverse themselves. Example: [Amirtha, Mani, Sunaina, Ramesh, Nammi] are playe would shout out a number "T" and in groups of the kids are in the order: [Mani, Amirtha, Ramesh, Sunaina, Nammi]. Tina would never call out a ne and the instructor shouts out 2 . After this round, less or equal to the number of kids playing the game. If the number of kids playing are not a multiple of "i" then the left-out kids, at the end would remain in thein positions. Write a pseudocode for this game using an appropriate data structure and mention your complexity using Big-Oh notation. [2+3=5M ]