Professor jones has proposed a new sorting algorithm (pseudocode is given below) jones_sort (a, i, j) //swap element i with element j if (i+)2 j return jones_sort (a, i, j-k) jones_sort (a, itk, j) jones_sort (a, i, j-k) //first two-thirds //last two-thirds //first two-thirds again 1(a). (5 points) if a l]-[6, 3, 2, 5, show the array after each swap when jones_sort(a, 0, 3) is called 1(b). (10 points) determine the worst-case time complexity of jones_sort() using 00) notation in terms of the size of the array, n.

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.

Whats three fourths of 15(this is supposed to be in math but i clicked too fast)

Description: write function lastfirst() that takes one argument—a list of strings of the format "lastname, firstname" —and returns a list consisting of two lists: (a) a list of all the last names (b) a list of all the first names