What are the key constructs required to create a loop? Identify two scenarios that may require two different types of loops. Be sure to provide specific details for each scenario that illustrate why the different types of loops are required. Actively participate in this discussion by providing constructive feedback on the scenarios and details posted by your peers.

Task 1: Finish the given program to implement and run bucket_sort. Starter code is provided. The program will read a file name and the read the data for the array from that file and run bucket sort on that array to sort it. It will print the array before and after sorting and the buckets.It will repeat these steps as long as the user wants to. Files:This program consists of 3 fileslist.h, list.c - these should NOT be modified at all.and bucket_sort.c - You should write your code in this file, starting with run1(). Do NOT modify main().The given files compile and run with Valgring with instructionscompile: gcc -g bucket_sort_sol.c list.c -lm Run: valgrind --leak-check=full --show-leak-kinds=all ./a.out However bucket_sort.c has only a placeholder in run1().run_placeholder.txt - shows the program output when running with the bucket_sort.c as given (before you add your code).run_student.txt - shows the program output AFTER a the student solution was added. Your final program should have this behavior.a.out here is the program executable (creared on Ubuntu).data1.txt, neg1.txt, dex1.txt - Data files. These are UNIX text files. They have the Unix end-of-line (EOL) terminator LF. Note that Windows has CR LF and Mac has CR. Thus do not mix files from different systems. Run your code on a Unix environment (omega, VM, or Ubuntu) and use the provided Unix files. To download them, open them (in browser) and RIGHT-CLICK -> "Save As". DO NOT copy paste in a local text file as that may be saved with your OS's EOL (CR or CR LF).See https://en.wikipedia.org/wiki/Newline). You may want to know that some editors (and a command in the Unix system) will allow you to save the file in a specific format if you need to make that change.For an example for reading from files see (on the Daily page) program examples1.c covered at the beginning of class.File format - The first number in the file is N (to be used as the size of the array) and on the next line there are N integers. E.g.6 9 1 7 5 8 2 means the size of the array will be 6 and the array will be {9,1,7,5,8,2}.To compute the index for the bucket use the formula that adjusts the range based on teh array data. For example for array {9,1,7,5,8,2} max=9, min=1, max-min+1=9, N=6 => number 7 goes to index=round_down(((7-1)/(9-1+1))*6) = round_down((6/9)*6) = round_down(4/3) = 1. That is how the indexes shown are produced:Bucketsort: min=1, max = 9, N=6 buckets arr[0]= 9, idx = 5 arr[1]= 1, idx = 0 arr[2]= 7, idx = 4 arr[3]= 5, idx = 2 arr[4]= 8, idx = 4 arr[5]= 2, idx = 0 Resources:For an example of how to create an array of linked lists, - See section “Array of Linked Lists” in slides Linked Lists in C REVIEW. These slides are NEW and they try to give a useful review for linked lists and new material (such as drawing the and problem-solving for loops).Requirements:You can assume the files will always have the above format. You do not need to handle the case if they no not.There should be no memory errors on Valgrind.Grading criteria - 10 pts - data is read from the file - 15 pts - no Valgrind errors. - 35 pts - bucket sort Task 2: Sign in to leetcode and solve the problems listed below. (Create a leetcode account if needed, or work with a friend.) Feel free to discuss with a classmate (or your team mate) any of these leetcode problems. Also read their solution (after you have tried, and maybe even solved it, on your own). If you do not know fow to solve one of the leetcode problems, it is ok to read the solutions and explanations posted on leetcode. However, please take advantage of this opportunity to have a group study and to discuss with us any questions you have. EVen if you have solved the problem, do check their solution discussion. It is often interesting.206 Reverse linked list (easy) - 10pts83. Remove Duplicates from Sorted List (easy) - 10 pts86. Partition List (medium) - 10 ptsA problem of your choice. It can be of any difficulty level. - 10 ptsWhat to submitSubmit: bucket_sort.c and a pdf or jpeg with a screenshot that shows the required problems maked as done in leetcode. You are given a program that has the basic linked list functions, the main function and a place holder function named run1(). You should not modify main or any of the linked list functions. You can only write the code for run1(). DO not put all the code in run1(). Write your own new helper functions and all them in run1().

Concepts to Practice • Multi-dimensional arrays • Passing arrays to functions • Symbolic constants • Expand the prelab Submission Information Submit this assignment by following the instructions given by your TA. SUBMIT ONLY the .c file (no a.out or executable file is required). All the lab assignments must be submitted before the end of the lab using the lab code given by the TA. Use the following submit command: mucs submit For example: mucs submit 1050 lab lab7.c Description For the lab assignment, you need to declare a 2-dimensional array with the same data as your prelab, but now the rows and columns have been transposed: Student Nelson Earle Raj Mode Roland Oruche Dilruba Parvin Sweta Praharaj Jim Ries Genevieve Saab Ali Allami Daniel Dopp Ryan Orf Prachi Tripathi Rudra Shukla CS 1050 72 95 93 98 99 47 97 85 96 94 98 76 Math 1500 68 88 97 77 92 32 99 95 91 90 98 82 English 1000 62 95 86 98 90 27 85 91 99 85 90 98 This time, you will also need to declare another array that represents the “curve” for each of the courses. That is, the “curve” array will have cut-offs for A’s, B’s, C’s, and D’s for each of the 3 courses. To make things simpler, just assume there is no +/- grading (e.g., a student can get a grade of “A” or “B” but not “A-“ or “B+”). Here are the curves: Course CS 1050 Math 1500 English 1000 A Cutoff 85 95 90 B Cutoff 75 85 75 C Cutoff 60 75 55 D Cutoff 50 65 40 You job is to print out a letter grade in each course for each student. You will do this by passing your arrays into a function that calculates letter grades from the scores and the grade cutoffs. Don’t worry about the column headers or row headers – you can just print something like “Student 0” and the grades for that student in order (see sample output below).