plo IE e he mbile devices that it produces media retrieval time from a playlist that is in alphabetical order. Your Algorithm Group has recently bee decided to test a divide and conquer approach. Assignment Part 1 . In C++, code a search algorithm that searches a list of strings for a particular song. The searching string array that contains a list of songs in alphabetical order; and a particular song, which is a st return the index of the song, and it will return-1 otherwise. This searching algorithm will employ a divide-and-conquer approach similar to that in binary sea split in 2 sublists during each step; however, for your assignment, you will build and algorithm th Part 2 What is the time complexity (in Big-O notation) of your algorithm with respect to the size of the p . e How does this time complexity compare to the time complexit Please submit your assignment. For assistance with your assignment, please use your text , Web resources, and all course material Other Information There is no additional information to display at this time. ei timedia/mobile company you work for is currently attempting to transfer large media files from older disks to newe of these files in any haphazard order is fairly straightforward: however, you believe that you can improve upo ace on the new disks. You have a collection of m disks, but you believe that if you smartly organize the media files onto the n a haphaza u plan to design a greedy algorithm to efficiently transfer media to storage devices. Note that this is an optimization prob nsist of some quantity to be maximized or minimized under some list of constraints. In this problem, you have n files Ur store these files onto m disks, d... dm that have corresponding storages amounts t.... m. Note that one file cannot be s inimize the amount of storage that is not used on each disk (that is used). This should also minimize the total number of nu ach disk as much as possible while leaving a minimally small amount of unused storage. (tn the perfect case each disk wout torage) If there are any disks left unused, you will be able to return them for a refund. ssignment art 1 Design a greedy algorithm using pseudocode that solves this optimization problem of transferring files to disk while min the number of files n, corresponding sizes (in MBs) S.. 'n. m the number of disks, and corresponding storages amounts which contains the disk index of which the ith media file should be stored. Comment your pseudocode for increased readability Part 2 Discuss the optimality of your algorithm. Is it guaranteed to return an optimal result? What Is the Big-O time complexity of this algorithm in terms of m and n? Justify your answer Part 3 : Ifyou were to solve this problem using a brute force or exhaustve search method, what would be the time complexity? ju Please submit your assignment For assistance with your assignment, please use your text, Web resources, and all course materials