Task 1: Implement and Test a Sorting Algorithm 1. Create a Java project and implement your own selection sort function algorithm. 2. Test your implementation by generating an array of random integers of size 100 and sorting them using the selection sort algorithm. 3. Compare the time taken to sort the array using the selection sort algorithm with the time taken to sort the same array using the in-built Java sort method (Arrays.sort). 4. Conclude which one is faster Task 2: Implement and Test Binary Search 1. Implement the binary search algorithm in Java. 2. Test your implementation by generating an array of random integers of size 100 and sorting them using the selection sort algorithm. 3. Use the binary search algorithm to find a specific element in the sorted array. 4. Compare the time taken to find the element using the binary search algorithm with the time taken to find the same element using the in-built Java binary search method (Arrays.binarySearch). Submission: 1. 2. Note: Submit the Java code for the selection sort algorithm, binary search algorithm, and the test code. Include the results of the comparison between the time taken by your implementation and the in-built Java methods. Ensure the code is well commented and easy to understand. Use a timer to measure the time taken for sorting and searching. Hint: you may use this to calculate your running time. long start Time = System.nanoTime(); .....your program.... long endTime = System.nanoTime(); long totalTime = endTime - startTime; System.out.println(totalTime);

NOTE: DO NOT USE ARRAYS for your solutions. Create a Java program See the attached image for the instructions. Please follow the instructions.

THIS NEEDS TO BE DONE IN C#!! The Tourtise and The Hair In this lab, we will be simulating the classic race of the tourtise and the hare. The race will take place on two paths of 70 tiles, which spans from left to right. The path will have two lanes, one for each animal. The path will be represented as an array of 70 characters, where each character will be the following: · A dash(i.e, “-“), which represents an empty tile. · An “h”, which represents the hare on the hare lane. · A “t”, which represents the tourtise on the tortise lane. All tiles will be “empty” (i.e. set to the dash) with the exception of the tiles that are occupied by the animals. As the animals move, the previous tile the animal was on will be set to empty, and the new tile will be changed to either “h” or “t”. Tile 70 will be the finishing tile, and the first animal to that tile will be declared the winner of the race. We will use randomization to determine how far each animal will move. Since this race will be…

Write a C program for the image attached. Thank you