The following are the CPU and I/O behavior of three processes, timings in seconds. Process P1 has 1 second CPU burst followed by 3s I/O followed by 1s CPU burst
Process P2 has 2 second CPU burst followed by 2s I/O followed by 2s CPU burst
Process P2 has 4 second CPU burst followed by 1s I/O followed by 4s CPU burst
Please provide approximate sketches of Gantt charts, and average turnaround times for the following scheduling algorithms:
Round Robin with a smallish time quanta (below 0.1s)

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.