Knap Sack Problem (algorithm to solve the Knap-Sack problem (sack size = K) is given below to help you). Array S[ ] has the size of items available for selection. Given an integer K (the size of a knap sack) and n items of different sizes such that ith- item has an integer size S[i], find a selection of subset of items whose sizes sum to exactly K, or determine that no such subset exists. No fractional selection is permitted K = 16 // knap sack size // items S[1] = 1, S[2] = 4, S[3] = 6, S[4] = 7, S[5] = 8

Table is given below to help you. In the table, Enter a I in the table if a solution exists for a sack size and includes the item. Enter a O in the table if a solution exists for a sack size and does not include the item. Enter a -- in the table if a solution does not exist for a sack size. First two rows of the table have been completed to help you get started.