Transcribed Image Text: 2. Bob and Permutations
Bob is fascinated by permutations, so he reached out to Allce and
Yoda to find a good question on permutation of [1, 2, 3, …, n].
Let Aq, A2.
An denote Bob’s permutation. Allce and Yoda gave
the following condition which should be satisfied such that there
exists an i between 2 and n-1 (both inclusive):
• Aj > Aj+1 Visjsn- 1.
• Aj > Aj-1 V 2sjsi.
means “for all”
Bob in finding out the number of permutations that satisfy
conditions given by Alice and Yoda.
You will be given 1 integer n
You need to complete the function where the above integer will be
given as an argument.
Return the number of permutations modulo 10+7