Develop a multithreaded app that can find the integer in the range 1 to 10000 that has the largest number of divisors. It should print that integer as well as the time spent to finish the calculation. You can use any language (e.g. C, Java, or Python), and Any API library.
Submit the following:
- The multithreaded App code with all comments
- Screenshot of the output for both programs
- Assignment report which will answer the following questions:
- How long it took your app to finish the job when using 1 thread?
- How many threads your machine can run simultaneously?
- How long it took your app to finish the job when using all available threads?
- Did you use task or data parallelization for this program? Why?
