Write a python function treasure_hunt that takes as arguments positive integers mm, nn and pp and returns the number of valid configurations of the m×nm×n grid world that follows the following rules. the "world" has mm columns and nn rows in it. there is one knight, one treasure chest and p≥0p≥0 dragon(s) in the grid-world. dragons cannot share a square with anything else. the knight can share a square with anything. dragons are indistinguishable from one another. the inputs mm and nn will satisfy 1≤m, n≤501≤m, n≤50, and pp will be a nonnegative integer less than or equal to mn−1mn−1. you may assume the code will never be run where there are no valid configurations at 1: think of the task of constructing a valid world configuration by placing the treasure, knight and dragon(s) into the grid as a sequence of tasks. how many ways are there to perform each task? where should you be using the sum rule versus the product rule? hint 2: you can import the math package in python to use the factorial function.