example code of how to generate a dictionary of all the words within a file using loops. No functions can be used

Computer Science Please use go language programma to write this code. Write a program that creates a CSV file to store and retrieve data such as name, age, and salary. You should be able to read the data out of the file and display the data sorted by name. Hint: Make use of the Sort package to sort the data. Make sure you check the existence of the file, closing the file when there is an error Use defer, panic, and recover as needed.

Write the program that allows the user to sort using the Bubble Sort, Selection Sort, Insertion Sort  and Shell Short  The program should be able to read in data from a binary file.  The first element of the binary file will be used to tell how many elements to read in.  Once all the data has been read in, the program should sort the data.  The user should be able to choose which algorithm to use to sort the data.  The program should print the time before and after the sort - be sure to not print the start time until after the algorithm has been chosen from your menue.  The last part of the program should print out the value and location of three random positions in your array   The name of each algorithm:Insertion Sort   A description of the elapsed time found for each input file: 10numbers; 12 seconds 100number: 30 seconds ...   A screenshot of the output of your program showing the start time and stop time of each algorithm running on the largest file (1000000numbers) as well as the…

Write the program that allows the user to sort using the  Merge Sort and Quick Sort. The program should be able to read in data from a binary file (1000000numbers).  The first element of the binary file will be used to tell how many elements to read in.  Once all the data has been read in, the program should sort the data.  The user should be able to choose which algorithm to use to sort the data.  The program should print the time before and after the sort.  The last part of the program should prompt the user for a lower and upper bound.  These two values should then be used to decide how much and which part of the array will be display.  You should test all of the sorts on each of the data files.  There are a number of files (10numbers.zip, etc.) of increasing size that you can utilize for testing purposes.    Continue to add a a justification of the difference between the run times of each sort when compared to those you're reported on earlier. Include the screenshots of the…