Write the following two generic methods using insertion sort. The first method sorts the elements using the Comparable interface, and the second uses the Comparator interface. a. public static >b. void insertionSort(E[] list)c. public static void insertionSort(E[] list, d. Comparator<? super E> comparator)

answer:

what

explanation:

answer:

my guess it 8 i'm probably wrong

answer:

explanation:

answer:

// here is code in C++.

#include <bits/stdc++.h>

using namespace std;

//main function

int main()

{

  // variable

 int n;

 cout<<"enter a number:";

 // read the input

 cin>>n;

 // find the square root of the absolute value

 float square_root=sqrt(abs(n));

 // print the square_root

 cout<<"square root of "<<n<<" is: "<<square_root<<endl;

  return 0;

}

Explanation:

Read a number from user and assign it to "n".Then find its absolute value with abs() function.Then calculate the square root of the absolute value with sqrt() function.Print the square root of the number.

Output:

enter a number:-17

square root of -17 is: 4.12311

                                                         This is easy

                                                     sinserly Natalie 7 grader (this is not that hard)