assert (reverse_lower('abc') == 'cba')assert (reverse_lower('ABC') == 'ABC')assert (reverse_lower('A123bc') == 'A123cb')assert (reverse_lower('muic-2021') == 'cium-2021')assert (reverse_lower('M-ahid--ol') == 'M-lodi--ha')assert (reverse_lower('XJjHVzheiy') == 'XJyHViehzj')assert (reverse_lower('L5bIgto2gv6W') == 'L5vIgot2gb6W')assert (reverse_lower('sYmA5Poekfz0k9') == 'kYzA5Pfkeom0s9')assert (reverse_lower('hDuAt5zqBSFg6-F3') == 'gDqAz5tuBSFh6-F3')assert (reverse_lower('MreN13pdEbI28D1J3N') == 'MbdN13peErI28D1J3N') Partly ReverseYou should be familiar with the concept of reversing a string. In this task, you will write a different variationwhere not all characters are reversed.In particular, you will write a function reverse_lower (s:str) -> str that only reverses lowercase letters andleave other characters where they are. For example,reverse_lower('aBcD45ef') ==> 'fBeD45ca'TEST CASESIn the example above, we only reverse acef which gives feca, but then in the return string you need tomake sure that other characters remain at the same location. Therefore, the return string is fBeD45ca.Note how we leave _B_D45 unchanged.reverse_lower('abc')'cba'reverse_lower ('ABC') == 'ABC'reverse_lower('A123bc') == 'A123cb'==reverse_lower('muic-2021') == 'cium-2021'reverse_lower('M-ahid--ol') == 'M-lodi--ha'

Answer: Algorithms: Step1: we have create a reverse_lower function that takes as arguments char…

Answered: You should be familiar with the concept…

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

See similar textbooks

Related questions

Question

assert (reverse_lower('abc') == 'cba')
assert (reverse_lower('ABC') == 'ABC')
assert (reverse_lower('A123bc') == 'A123cb')
assert (reverse_lower('muic-2021') == 'cium-2021')
assert (reverse_lower('M-ahid--ol') == 'M-lodi--ha')
assert (reverse_lower('XJjHVzheiy') == 'XJyHViehzj')
assert (reverse_lower('L5bIgto2gv6W') == 'L5vIgot2gb6W')
assert (reverse_lower('sYmA5Poekfz0k9') == 'kYzA5Pfkeom0s9')
assert (reverse_lower('hDuAt5zqBSFg6-F3') == 'gDqAz5tuBSFh6-F3')
assert (reverse_lower('MreN13pdEbI28D1J3N') == 'MbdN13peErI28D1J3N')

Partly Reverse
You should be familiar with the concept of reversing a string. In this task, you will write a different variation
where not all characters are reversed.
In particular, you will write a function reverse_lower (s:str) -> str that only reverses lowercase letters and
leave other characters where they are. For example,
reverse_lower('aBcD45ef') ==> 'fBeD45ca'
TEST CASES
In the example above, we only reverse acef which gives feca, but then in the return string you need to
make sure that other characters remain at the same location. Therefore, the return string is fBeD45ca.
Note how we leave _B_D45 unchanged.
reverse_lower('abc')
'cba'
reverse_lower ('ABC') == 'ABC'
reverse_lower('A123bc') == 'A123cb'
==
reverse_lower('muic-2021') == 'cium-2021'
reverse_lower('M-ahid--ol') == 'M-lodi--ha'

Expert Solution

Step by step

Solved in 4 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

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