Which of the following is/are True? I) If PNP, 3-CLIQUE will be in NP-Complete, but not in NP.
II) Hamiltonian path problem is in NP-Complete, as it is in NP and a NP problem can be reduced
to Hamiltonian path problem.
II) Halting problem is NP-Complete as well as NP-Hard.
IV) Euler's circuit problem is in NP, as it can't be solved in polynomial time.
A) III and IV
B) only II
C) only IV
D) I and II​

1. so if i wanted to build a linux server for web services(apache) with 1cpu and 2 gb of memory.-operating at 75% of memory capacity2. a windows server with 2 cpu/ 4gb memory- operating at 85% of memory capacity3. a storage server with 1 cpu/ 2gb memory- operating at 85% of memory capacityhow much memory do i have to add for each server. so that the utilization rate for both cpu and memory is at a baseline of 60%."the details for the cpu like its processor or the memory's speed isnt to be concerned" yeah i kept asking my teacher if he's even sure about the but the whole class seems to be confused and the project is due in 3 days..this is a virtualization project where i have to virtualize a typical server into an exsi hypervisor.

Match the file formats with the types of multimedia they can store

(, urgent need): how do i change my username