You have four chains. Each chain has three links in it. Although it is difficult to cut the links, you wish to make a single loop with all 12 links. What is the fewest number of cuts you must make to accomplish this task?
One of the leprechaun is missing if you see the two pictures attached to this question. Where did he go? When he comes back, do you know where has he been?
