Assume that each pair is in reverse order (so that the second smallest element comes before the smallest, the fourth smallest element comes before the third smallest, etc.). For example,

60, 50, 40, 30, 100, 90, 20, 10, 80, 70
What is the exact number of comparisons in the best case as a function of n?

Problem 2. Assume that each pair is in order (so that the smallest element comes before the second smallest, the third smallest element comes before the fourth smallest, etc.). For example,

50, 60, 30, 40, 90, 100, 10, 20, 70, 80
What is the exact number of comparisons in the worst case as a function of n?

[a] create a class called “cycle” which has two instance integer variables as properties, “numberofwheels” and “weight.” create a constructor with two parameters, using the same variable names in the parameter list. assign each variable to numberofwheels” and “weight” respectively. write a separate application to test the class and display its properties. note: do not change the names of the instance variables or the variables listed in the constructor’s parameter list. [b] edit your class cycle by adding a default constructor which will assign the default values of 100 to represent the numberofwheels, and 1000 to represent the weight, by invoking a call to the other constructor. modify your application created in [a] to test the class.

Solve the following javafx application: write a javafx application that analyzes a word. the user would type the word in a text field, and the application provides three buttons for the following: - one button, when clicked, displays the length of the word.- another button, when clicked, displays the number of vowels in the word.- another button, when clicked, displays the number of uppercase letters in the word(use the gridpane or hbox and vbox to organize the gui controls).

The qwerty keyboard is the most common layout of keys on a keyboard