Develop your own algorithm and implement the C code for the following problem and compare single and multi threaded program performances:

You have a set of n books with weights w$1,$ w$2,...,$ wn $($in grams$).$ You must pack them into k boxes. The capacity of each of these boxes $($in kilograms$)$ is c$1,$ c$2,...,$ ck$.$ Our goal is to pack all of the n books in the k boxes without exceeding the capacity of any of the boxes.

Rules:

No group work

You will compile and execute your code $($you should bring laptop, tablet, mobile phone etc.$)$ and defend your project in class $(13-17$ May week will be evaluated out of $120,20-24$ May week will be evaluated out of $100)$

Draw flow chart of your algorithm by hand and bring it to the defence

User will input n and k values

c and w values will be generated randomly

You will check user input and randomly generated data integrity, no book can be larger than boxes, no box can carry all books.

You will calculate wasted storage capacitiy in grams

You will calculate how many boxes used out of k boxes

You will calculate efficiency of algorithm by $($wasted$\_$storage$)*($#used$\_$boxes$/$k$)$

Clearly display the result

You will upload both code together as a text into this assignment

Codes will go through similarity check

Similar codes will be evaluated as cheating