An arithmetic sequence is a sequence of values where successive values have a common difference. For example, 2,5,8,11,... is an arithmetic sequence starting at 2 with a common difference of 3. We call the starting point s and the difference d. Fill in the missing lines below to write a recursive Python function called arithmetic that takes values for s, d, and n, and returns the nth term of the arithmetic sequence. For example, given the main function: def main(): for i in range(1,6): print(arithmetic(2,3,i)) the output will be: 2 5 8 11 14 Note: No marks will be given for a non-recursive solution. Code with missing lines: # Line 1 # Line 2 # Line 3 # Line 4 # Line 5 Matching each line of code below to its proper line number (Line 1 to Line 5), indicated in the partial code above, to solve the problem.  Some lines of code will not be used at all; for these you would select option 6 (i.e., Not Used) from the list of options - do not leave these blank.    Question 8 options:   return d + arithmetic(s,d,n-1)   return arithmetic(s,d,n+d)   if n==1:   def arithmetic():   return 0   def arithmetic(s,d,n):   if n==s:   else:   return s   elif n==d:   1. Line 1 2. Line 2 3. Line 3 4. Line 4 5. Line 5 6. Not Used

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

An arithmetic sequence is a sequence of values where successive values have a common difference.

For example, 2,5,8,11,... is an arithmetic sequence starting at 2 with a common difference of 3. We call the starting point s and the difference d.

Fill in the missing lines below to write a recursive Python function called arithmetic that takes values for s, d, and n, and returns the nth term of the arithmetic sequence.

For example, given the main function:

def main(): for i in range(1,6): print(arithmetic(2,3,i))

the output will be:

2 5 8 11 14

Note: No marks will be given for a non-recursive solution.

Code with missing lines:

# Line 1 # Line 2 # Line 3 # Line 4 # Line 5

Matching each line of code below to its proper line number (Line 1 to Line 5), indicated in the partial code above, to solve the problem.  Some lines of code will not be used at all; for these you would select option 6 (i.e., Not Used) from the list of options - do not leave these blank. 

 

Question 8 options:

 

return d + arithmetic(s,d,n-1)

 

return arithmetic(s,d,n+d)

 

if n==1:

 

def arithmetic():

 

return 0

 

def arithmetic(s,d,n):

 

if n==s:

 

else:

 

return s

 

elif n==d:

 
1.

Line 1

2.

Line 2

3.

Line 3

4.

Line 4

5.

Line 5

6.

Not Used

Expert Solution
steps

Step by step

Solved in 4 steps with 2 images

Blurred answer
Knowledge Booster
Fibonacci algorithm
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education