What is time complexity of the above dynamic programming implementation of the dice throw problem where f is the number of faces, n is the number of dice and s is the sum to be found?

• A. O(n*f)
• B. O(f*s)
• C. O(n*s)
• D. O(n*f*s)