Assume that Adam has 4 books to be bought. For each book, Adam can buy it from 3 different shops. Further assume each shop is unique. Using graph/tree graph,show the possible ways to buy all books starting from book 1 to book 4 in sequence.
you should have 4 main branches, with each of those branches having 3 of their own
result ---> 4x3 = 12