Given a N∗M matrix of numbers from 1 to N∗M(each number occurs only once), find a path from top left to right bottom while movi

Answer 1

Given a N∗M matrix of numbers from 1 to N∗M(each  number occurs only once), find a path from top left to right bottom while moving right or down only. If we sort all values visited in this path it should be lexico-graphically smallest

Answer 2

Do your own homework!

Answer 3

question is incomplete

Answer 4

You can edit the question and add the question details you added as a comment to the description section.

in the question area put something like Help; Find the shortest path or something like that.

hint: use the 3 at the top right corner

Answer 5

oo sorry wait i m trying to post it again but just please Upvote my question

Answer 6

bro i m not able to answer it that's why i m asking you and yups i m not a programming student so it's not my homework i actually learns programming online. anyway thanks😊👍