2. Bob and Permutations Bob is fascinated by permutations, so he reached out to Alice and Yoda to find a good question on permutation of [1, 2, 3, ..., n]. Let A1, A2. ., An denote Bob's permutation. Alice 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 V isjsn-1. • Aj > Aj-1 V 2 sjsi. means "for all" Help Bob in finding out the number of permutations that satisfy conditions given by Alice and Yoda. Input You will be given 1 integern You need to complete the function where the above integer will be given as an argument. Output Return the number of permutations modulo 10+7 Constraints 1sns 10° Sample Case Input:

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
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"
Help Bob in finding out the number of permutations that satisfy
conditions given by Alice and Yoda.
Input
You will be given 1 integer n
You need to complete the function where the above integer will be
given as an argument.
Output
Return the number of permutations modulo 10+7
Constraints
1sns 109
Sample Case
Input:
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" Help Bob in finding out the number of permutations that satisfy conditions given by Alice and Yoda. Input You will be given 1 integer n You need to complete the function where the above integer will be given as an argument. Output Return the number of permutations modulo 10+7 Constraints 1sns 109 Sample Case Input:
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY