. Problem. Given a message s and a number m, write an algorithm to print the following info m times: I am printing s m times Where s is the given message and m is the given number. When specifying your algorithm, follow format of the algorithm specification in the class. 3. Based on the problem decomposition method and iterative refinement method, write an algorithm for the wine cup problem (see lecture notes). You only need the final algorithm with the appropriate format. For the plan part, use pseudocode with comments. 4. Write the precise definition of asymptotic Lower Bound. See lecture notes for example of precise definition of, e. g., asymptotic Upper Bound

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.