The purpose of performance profiling (experimental analysis) is to measure the program/algorithm performance. Assume that you have performed an experimental analysis of an algorithm, and profiling returned the following times: for instances of sizes 2^10, 2^11, 2^12, 2^13, 2^14
the corresponding times are approximately 300 , 510 , 905 , 1750 , 3305 milliseconds.
In these collected running times, there is an extra overhead resulting from clocking program performance and OS functions calls, and this overhead has to be considered in analyzing data. That is, the measured time consists of two components: the time for executing the operations, plus the overhead from profiling.
The estimated overhead due to profiling is about 100 milliseconds independently of the input size. (that is, 100 is always an additive ``constant'' in the collected times).
Based on these experimental results, what is the running time, as a function of the problem size, for executing this algorithm? (c is a constant).
A. O(underroot(n)).
B. O(n^2).
C. O(n).
D. None of the listed.
E. O(n log n).

Write a modular program (no classes yet, just from what you learned last year), that allows two players to play a game of tic-tac-toe. use a two-dimensional char array with 3 rows and 3 columns as the game board. each element of the array should be initialized with an asterisk (*). the program should display the initial board configuration and then start a loop that does the following: allow player 1 to select a location on the board for an x by entering a row and column number. then redisplay the board with an x replacing the * in the chosen location. if there is no winner yet and the board is not yet full, allow player 2 to select a location on the board for an o by entering a row and column number. then redisplay the board with an o replacing the * in the chosen location. the loop should continue until a player has won or a tie has occurred, then display a message indicating who won, or reporting that a tie occurred. player 1 wins when there are three xs in a row, a column, or a diagonal on the game board. player 2 wins when there are three ox in a row, a column, or a diagonal on the game board. a tie occurs when all of the locations on the board are full, but there is no winner. input validation: only allow legal moves to be entered. the row must be 1, 2, or 3. the column must be 1, 2 3. the (row, column) position entered must currently be empty (i. e., still have an asterisk in it).