title: Algorithmic Strategy for selection of minimum number of baskets
body: <p>Example:
  You have 4 baskets named P,Q,R,S.
  You have 4 items in those baskets named A,B,C,D.</p>
  
  <p>The composition of baskets are as follows
  <a href="https://i.stack.imgur.com/q4zD3.png" rel="nofollow noreferrer">PIC</a></p>
  
  <p>--<strong>A  B  C  D</strong></p>
  
  <p><strong>P</strong>  6  4  0  7</p>
  
  <p><strong>Q</strong>  6  4  1  1</p>
  
  <p><strong>R</strong>  4  6  3  6</p>
  
  <p><strong>S</strong>  4  6  2  3</p>
  
  <p>Basket P has 6A, 4B, No C's and 7D.</p>
  
  <p>Suppose you get following requests:
  You have to give out 10A, 10B, 3C and 8D.</p>
  
  <p>The minimum number of basket required to process the request is 2 (P,R).</p>
  
  <p>How can I reach this algorithmically. What algo should I use, what should be the strategy?</p>