Given an unsorted array A of n distinct integers and an integer k, you need to return the k smallest integers in the array in sorted order, where k may be any integer between 1 and n. Suppose that you have the following three algorithms to solve this problem. A1: Sort the array in increasing order, then list the first k integers after sorting. A2: Build a min-heap from these n integers, then call Extract-Min k times. A3: Use the linear time selection algorithm to find the k-th smallest integer in the array, then partition the array about that number to obtain the k smallest numbers in the array, and finally sort the k smallest numbers. Assume that you are using mergesort as your sorting algorithm, and use the linear time build-heap algorithm to build the heap. Let T1(n, k) denote the worst-case running time of Algorithm A1. Let T2(n, k) denote the worst-case running time of Algorithm A2. Let T3(n, k) denote the worst-case running time of Algorithm A3. Analyze the worst-case running times of the algorithms. Write a brief justification to your answer to Q1-7.

List all primitive types. For the numeric primitive types, include their size in bits along with them.

You can declare a variable of type double and initialize it with a value of type int

Write the output of the following snippet of code (use the space in the right)

Indicate the value and type of the following expressiontrue && (false && false || true)Value:Type:

In the ASCII table, all uppercase (English) characters come before the lowercase (English) characters.

Indicate the value and type of the following expression 1 + 3

Java is the first object-oriented programming language developed.

[Extra Credit]: What was one topic that we covered that you found most interesting and why?

Given the class Averager with a main method that calculates the average of the provided numbers as console arguments, provide the terminal command that would result in an average of 19. Assume Averager has already been compiled. You must provide more than 1 number.