## Question 1 What will be the output if the following values of input are given? $m$ = 2 $n$ = 2
### Options 1. 1 Incorrect ---------------------------- 2. 2 Correct There are a total of two unique paths from the top-left corner to the bottom-right corner of the grid. ---------------------------- 3. 3 Incorrect ---------------------------- 4. 4 Incorrect ---------------------------- --------------------------------------------- ## Question 2 What will be the output if the following values of input are given? $m$ = 3 $n$ = 3
### Options 1. 2 Incorrect ---------------------------- 2. 3 Incorrect ---------------------------- 3. 5 Incorrect ---------------------------- 4. 6 Correct There are a total of six unique paths from the top-left corner to the bottom-right corner of the grid. ---------------------------- --------------------------------------------- ## Question 3 What will be the output if the following values of input are given? $m$ = 3 $n$ = 4
### Options 1. 4 Incorrect ---------------------------- 2. 10 Correct There are a total of ten unique paths from the top-left corner to the bottom-right corner of the grid. ---------------------------- 3. 12 Incorrect ---------------------------- 4. 14 Incorrect ---------------------------- ---------------------------------------------