Answer:
The correct answer will be "400.4 N". The further explanation is given below.
Explanation:
The given values are:
Mass of truck,
m = 600 kg
g = 9.8 m/s²
On equating torques at the point O,
⇒ 
So that,
On putting the values, we get
⇒ 
⇒ 
3-SAT ≤p TSP
If P ¹ NP, then no NP-complete problem can be solved in polynomial time.
both the statements are true.
<u>Explanation:</u>
- 3-SAT ≤p TSP due to any complete problem of NP to other problem by exits of reductions.
- If P ¹ NP, then 3-SAT ≤p 2-SAT are the polynomial time algorithm are not for 3-SAT. In P, 2-SAT is found, 3- SAT polynomial time algorithm implies the exit of reductions. 3 SAT does not have polynomial time algorithm when P≠NP.
- If P ¹ NP, then no NP-complete problem can be solved in polynomial time. because for the NP complete problem individually gets the polynomial time algorithm for the others. It may be in P for all the problems, the implication of latter is P≠NP.
Answer:
Sorry it doesnt tall me anythikng
Explanation:
Builderman is dksbdkbsnsbs
