F. Task(s)Divide and Conquer Algorithm - MergesortAssume that you have recently joined SortPro Inc. as an intem. SortPro engages in softwaresolutions for clients in the food and beverage industry and in the hospitality industry. As an intern,your Team Lead assigns you the task of developing a sorting algorithm for a client in the food andbeverage industry. The client takes food orders and wishes to have the option of sorting his foodorders by the order id. To check the soundness of your solution, your Team Lead asks you to writea program that will sort the food orders using Mergesort and to report the efficiency of thealgorithm. Your Team Lead has set the following requirements:• Auto-generate the order ids randomly. You may use a random function to generate theorder ids. The order id takes the form of FD9999 (the number of digits might changeaccording to the maximum number of orders, n, that is input by the user).• For each order id, the total cost of the order should also be auto-generated randomly. Thetotal cost of the order will be in the following format: RM999.99.• Sort the orders using Mergesort according to the order ids.• Display the list of the unsorted orders and the corresponding total cost of the order (if thisoption is selected by the user)• Display the list of the sorted orders and the corresponding total cost of the order (if thisoption is selected by the user)• Display the running time of the sorting algorithm.You are required to:a. Implement the scenario above using CIC+ programming language. Do apply thetechniques for good programming practices.b. Sample Input: ii. In your report:c. Write a pseudocode for your solution above. Do ensure that the pseudocode models theentire logical flow of your program.d. Illustrate the growth of the algorithm by:i. providing a table that reports the growth of the sorting algorithm in theimplementation above; andii plot a graph to illustrate the growth of the sorting algorithm.To illustrate the growth of your sorting algorithm, run the program with at least thefollowing n values (n represents the number of order ids that was generated): 1,000; 5,000;32,000; 512,000; 1,000,000. The growth of the algorithm is typically measured inmillisecond (ms) or microsecond (s) or nanosecond (ns).The growth rate of your sorting algorithm may vary due to your processor speed, memorycapacity and etc. Therefore, to illustrate the consistency of the growth rate of your program,you will need to perform and report a minimum of 5 trial runs on each of the n values. Youmay then take the average of the running time for plotting the graph and for the discussionin the section below.

Name: F. Task(s)Divide and Conquer Algorithm - MergesortAssume that you hav
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: F. Task(s)Divide and Conquer Algorithm - MergesortAssume that you have recently joined SortPro Inc. as an intem. SortPro engages in softwaresolutions for clients in the food and beverage industry and in the hospitality industry. As an intern,your Te