The game dien is played in the following way:
you will be given a die with n sides. you will know the size of n, and can assume that n is a value greater than 1 and less than or equal to 30. you will be given a bit mask vector isbadsiderepresenting the sides of a die that will make you lose. the vector will be of size n, and 1 indexed. (there is no 0 side) you start with 0 dollars. at any time you have the option to roll the die or to quit the game if you decide to roll: and you roll a number not in isbadside, you receive that many dollars. (eg. if you roll the number 2 and 2 is not active -- meaning the second element of the vector is 0 -- in isbadside, then you receive 2 dollars) repeat step 4. and you roll a number in isbadside, then you lose all money obtained in previous rolls and the game ends. if you decide to quit: i. you keep all money gained from previous rolls and the game ends.
for this problem, determine an optimal policy for playing the game dien for n sides. you will be givenn and the array isbadside which indicates which sides are bad. as you will see, the optimal policy for this game will depend onyour current bankroll.