1. Suppose I have a set of polyhedral dice, each of which has some number of sides n. The sides of an n sided die are labelled 1 to n. It is an interesting question to determine how many ways you can roll a given sum using an arbitrary set of dice:-

A. If I have four dice, with number of sides equal to 2(a coin), 4(a tetrahedron), 6(a cube), and 8(an octahedron) how many ways are there to roll a total of 13?

B. Devise a dynamic programming algorithm that, given an arbitrary list of side numbers S, and a target value t, determine the number of ways the dice can be rolled and sum to t.

This is single question and A and B are the questions to be solved.