The bin packing problem is: You are given a supply of k bins, each bin is of size 1, and you also are given m objects, o1, o2, ..., om, where oi has size si and 0 < si ? 1 is a fraction between 0 and 1. The problem is to determine if you can pack all m objects into the k bins you are given. Define a verifier that proves that the bin packing problem is in NP. Say what the input to the verifier is, what the verier does on its input, and why the verifier runs in polynomial time.