please help me with this computer science question in python, thank you

Implement value iteration for general n x m gridworlds with an arbitrary but prescribed number of terminal states (and their associated rewards) and inaccessible states in Python. Your environment should be defined by specifying the number of rows n and columns m as well as a list of inaccessible states and terminal states with their associated values. All non-terminal transitions should incur a reward of -1. Test your implementation by solving the gridworlds given in Tables (1) and (2). Table 1: A 4 x 4 gridworld. Gray states are inaccessible, the blue states issues a reward of 0, all other transitions a reward of -1. Table 2: A 5 x 6 gridworld. Gray states are inaccessible, the green state issues a reward of 10, the blue state a reward of 10, all other transitions a reward of -1