java program cont. part 2 & 3

0. Design, code, and test a file-management program* Write a modular, well-documented program, that reads a collection of objects (not just strings or integers) from a text file and stores it in an array or ArrayList of objects (or reuse and add documentation to a program you wrote for Data Structures). The user should be able to choose how many items to read. Thus you will write two classes - one for the objects you are reading, and one for the collection. The collection class will contain an array of the objects. 0.0f Report empirical performance of fast and slow search algorithms* Extend the program you submitted for 0.0 e to obtain running times, in counted steps or in microseconds, for fast and slow search algorithms. Provide timing or step-counting data for collections of different sizes, e.g., 10, 100, 1000, 10,000. Thus you are timing the performance of two algorithms and several array sizes, e.g., 10, 50, 200, 1000, 5000; at least 45=20 timing results. Graph the data describing the performance of each algorithm as a function of array size. 0.0g eport empirical performance of fast and slow sort algorithmst Extend the program you submitted for 0.0e to obtain running times, in counted steps or in microseconds, for fast (Quick, Merge, Heap, or BST based) and slow sorting algorithms (e.g., Bubble). Provide timing or step-counting data for collections of different sizes, as for the search algorithms tested in 0.0g