You are an usher in a theater with n balconies for a children’s matinee performance with n children in attendance. you are given a list of m statements of the form "i hates j." if i hates j, then you do not want to seat i above or in the same balcony as j, otherwise i will throw popcorn at j instead of watching the play. give an algorithm that assigns balconies to children (or determines that no feasible assignment exists) in time o(m + n). we can assume that balconies are numbered ascending with height.（when you are asked to ‘give’ an algorithm, be sure to prove that it is correct and exhibits the desired running time!

Develop a function to create a document in the mongodb database “city” in the collection “inspections.” be sure it can handle error conditions gracefully. a. input -> argument to function will be set of key/value pairs in the data type acceptable to the mongodb driver insert api call b. return -> true if successful insert else false (require a screenshot)

Design a class tictactoe that: holds the following information about the game: two-dimensional array (3 by 3), and winner. add additional variables as needed. includes the functions to perform the various operations on objects. for example, function to print the board, getting the move, checking if move is valid, determining if there is a winner after each move. add additional operations as needed. includes constructor(s). write the functions of the class, and write a program that uses the class. the program should declare an object of type tictactoe. the program will create the board and store it in the array. the program will allow two players to play the tic-tac-toe game. after every valid move update the array, check if there is a winner. if there is no winner and no tie, then print the board again to continue.

Animations and transitions are added from the