Suppose we have problems P1 and P2. Suppose there is a polynomial-time reduction from P1 to P2. a. What can we say about the existence of an efficient algorithm
for deciding P1 if there is an efficient algorithm deciding P2?

b. Can we say the same thing about an efficient algorithm for
deciding P2 if there is an efficient algorithm deciding P1?

(Here an efficient algorithm is one that runs in polynomial-time
in the size of its input).

Your computer running windows 10 is doing some very strange things with the operating system. you are fairly certain it is not a hardware issue. you need to try to get further insight into what is going on within the operating system. which tool would be best suited for this?

Donna and her team of five have invented a new gadget for the science exhibition in their college. which intellectual property right will protect their invention?

Write a function so that the main0 code below can be replaced by the simpler code that calls function mphandminutes tomiles0. original main0 int main) l double milesperhour-70.0; double minutestraveled = 100.0; double hourstraveled; double milestraveled; hourstraveled = minutestraveled / 60.0; milestraveled = hourstraveled * milesperhour; cout < "miles" 2 using namespace std; 4 /* your solution goes here/ 6 int maino 1 test passed 7 double milesperhour 70.0 all tests passed 8 double minutestraveled 100.0; 10 cout < < "miles: " < < mphandminutestomiles(milesper-hour, minutestraveled) < < endl; 12 return 0; 13