In how many ways can one go from point A to point B in the following figure. If movement is allowed only along the edges, travelling the least distance possible in each case?
Attachments:
Answers
Answered by
0
Answer:
To reach B from A he has to take three right steps and three upward steps no matter what he takes first . So we consider this problem as arrangement of 2 distinct objects(i.e right step and upward step ) 3 each .
So answer is
3!×3!
6!
=20
Step-by-step explanation:
that is your answer please mark me branlist
Similar questions