Quick question on this one, I came up with some code ideas but it's wrong, obviously im also missing 1 argument as there suppose be 2 of them.

One of the senior wizards Yee Sian was trapped in a maze during a mission. The maze has n * m cells, labelled from (D, "\" I'm\" ""'wm' D] to (n-1. rn-1). Starting at cell [t]. 0). each time Yes Sian can only take one step, either to the rttt oa' down. We wish to find out the number of possible paths to the destination {n -1. m -1].A sample path is shown in the gure below. Having learnt the technique of speeding up the pascal function through mennlntlon, you decide to apply it here; If Yee Slan can walk out by himself (number of paths 2- a). tell him how many ways there are. Othemlse, report to Grandwizard and send a rescue team. Write a function nun_of_paths that takes In two integers representing the number of rows (n) and columns (m) in a maze and returns an Integer value of number of paths from cell {0, D} to cell (n -1. m - 1). The table and skeleton code are given to you. Your table is essentially a dictionary that stores (1, j } : val. pairs which indicate the numberof paths from cell (0. D) to cell (Lj). Note: You may assume that all inputs n and m are valid. is. n > i]. m 2- D. templatepy 1 table = {} at table to memorize computed values 2 33v def num_of_pat_hstn, m}