There is a street with n shops and each shop having k items. You need to start from the first and end at the last shop and find the minimum cost to pick items from each shop.
You can pick one item from each shop.
You cant pick same items from 2 adjacent shops.

Eg :

X     6     1     1
Y     50   50   50
Z     8     20   10

X, Y Z are items to be picked from each shop.
Minimum cost path -> 8,1,1