USE PYTHON. Take input from files called "inputX.txt" and output at "outputX.txt". Use Dynamic Programming approach to solve the following problem Problem: We would like to find the minimum number of...

USE PYTHON.

Take input from files called "inputX.txt" and output at "outputX.txt".

Use Dynamic Programming approach to solve the following problem

Problem:

We would like to find the minimum number of steps required to get 0 from any number, when you can only subtract a digit present in that number in a single step.

For example, if you are given 25. Then you can either subtract 2 or 5 from 25. Let's subtract 5 then we will get 20. Then we can subtract 2 and get 18 and so on. The minimum number of steps to get from 25 to 0 is shown below:

25→20→18→10→9→0.

Now you need to write a DP program to find the minimum number of steps to solve the problem for any input. Input range will be from 0 to 999.