solve it urgent plzzplzz

Consider the following list of items: Page 1 A shopkeeper has a knapsack of 30kg. He wants to fill the item such that after selling each item from the knapsack he can get the maximum profit. Write an algorithm to solve this problem in O(n) time. Calculate the time complexity when the above items are not arranged in the order they are given. Differentiate string matching algorithm and LCS. Suppose you have to match the pattern string "xbxbd" in text string "cxbcxbcxbxbxbd". Suggest, which algorithm can give you the best result. Demonstrate each step and calculate complexity of the algorithm