We studied the knapsack problem and solved it using recursion. Let us say the values are arranged in two dimensional array instead. The thief wants to start anywhere, pick up a series of items (by going up, down, left or right after picking up each item) and hopes for the total to match the target value. Here are a few examples using 4x4 array. Items in GREEN are selected & they total to specified target value in each case.

Develop your program to find whether a perfect match exists for a given target value. not necessary to output selected items or their position

22:11 nd it using mcc Let us say the valucs ar: arrange: in two dim:nso1al array c thic s to start anywhc Etc pick up a series of Items iby going up, down, left or right a ter p king up each item) a hopes for the tots to match the target value. llers are e few exemples uslng 4x4 arrey. Items In GR N are selected & they totelto is 20 4 9 57 32 7 24 ir