Mufaddal wants to travel from point H to point F as shown in image. How many ways can he travel from point H to point F if moving north and west directions are not permitted?
12
7
10
4
10
To find the number of ways Mufaddal can travel from point H to point F without moving in the north or west directions, we can use the concept of Pascal's triangle.
Step 1: Visualize the given grid with point H on the top left and point F on the bottom right.
Step 2: Draw diagonal lines connecting the corners of the grid.
Step 3: Start with point H and label it as 1.
Step 4: Move along each straight line, labeling each point with the sum of the numbers on the left and above it.
Step 5: Continue this process until you reach point F.
Below is the updated grid after labeling each point:
1 1 1 1 1 1 1
1 2 3 4 5 6 7
1 3 6 10 15 21 28
1 4 10 20 35 56 84
1 5 15 35 70 126 210
1 6 21 56 126 252 462
1 7 28 84 210 462 924
Therefore, looking at the grid, we can see that the number of ways Mufaddal can travel from point H to point F without moving north or west is 4.
Hence, the correct answer is 4.