1. Define using your own words: a) Bucket Sort b) Merge Sort c) Bubble Sort d) Quick Sort e) Insertion Sort 2. Explain in which situations it is better to use each of the sort types in task 1. 3. Create a program that does the following: 3.1) Ask the user which one of the sorting algorithms in point one does he want. 3.2) Then as the user for the input of the array that will be sort. It will be an array of numbers. 3.3) How does he/she want to sort the array using the selected method (small-big, big-small) 3.4) Produce the result printing the selected method, the order selected (s- b,b-s) and the resulting array already sorted. 3.5) Add your own copyright message at the end