Please help & this is in Java***

Problem 1

Show the comparison of runtime of linear search and binary search using line chart and table. Execute both algorithms 6 times on same data (use random integer generators), where input data size are: 50000, 100000, 150000, 200000, 250000 and 300000. Please report worst case runtimes so that the search item is not found in the input data.

***The data set are random integers that you make up***

Problem 2

Show the comparison of runtime of bubble sort and merge sort using line chart and table. Execute both algorithms 6 times on same data (use random integer generators), where data size are: 50000, 100000, 150000, 200000, 250000 and 300000. In each execution, sort the data in ascending order. Include the following information in your report. Complexity of these algorithms in Big-O notation Programming language IDE Special libraries (if any) Operating system Hardware details (CPU and RAM information)

***The data set are random integers that you make up***

Sample result (table and line chart format): Runtime of Alg X (in Runtime of Alg Y (in Data size seconds) seconds) 14.05 0.01 50000 100000 56.9 0.02 150000 85.35 0.03 0.05 229.44 200000 0.0625 286.8 250000 0.065 300000 513.34 Runtime of Alg X and Y vs. Data size 600 Runtime of Alg X (in seconds) 400 --Runtime of Alg Y (in seconds) 200 200 600000 120000 180000 240000 300000 Data size