To solve a pretty though schedulingproblem, you decide to write an algorithm that simply tries all possible schedules. Unfortunately executing the codes takes a long time, lasting 24 hours! As a good programmer you decide to remedy this by parallellising your code. Unfortunately you haven't taken the Parallel Algorithms course yet, so you struggle a bit with how to do this. The result is that 30% of your code remains serial code. You have no idea on how to lower this percentage further, so instead you decide to throw money at the problem. Use Amdahl's Law to determine the number of processors (P) you need to buy to let the code run in less than 8 hours.

a. P<5 b. 5P<10c. 10P<20d. 20P