Develop a Java simulation application for comparison-based searching algorithms (sequential and binary search). The information of the application is as follows: i. Create a dynamic array type integer or string. Size is determined by user. ii. Request user to key in input values. iii. Request user to select Search Key. iv. Execute the following searching method: a. Sequential search algorithm b. Binary search algorithm V. For Binary search algorithm, please implement sorting method. vi. a. For each searching method, shows the following results: Status of searching (success @ fail) b. Location / Index of search key Number of comparisons performed C. vii. Based on the number of comparisons performed by both methods, provide the conclusion (which algorithm perform better) viii. Repeat step iii to vii for three (3) different values. Note: . A good program should show successful and unsuccessful searching cases. Compose a complete program that includes comments and explanations (if applicable) of each method involved. Print the output sample. You are free to include any other functions to the application (optional)