please slove this question in c. don't copy other's code. thanksWord A is considered a subsequence of another word B if A can be obtained by deleting 0 or more characters from string B. Given two words composed of lowercase and uppercase letters, can you check if A is a subsequence of B in a case-insensitive manner?RequirementsAssume the input length for the two strings is no more than 1000 characters.String library functions are NOT allowed.Character handling functions such as tolower() are allowed.Follow the format of the examples below.The program will read two words, then print YES if the first word is a subsequence of the second word, and NO otherwise.output:Examples (your program must follow this format precisely)Example #1Enter first word: HeLlOEnter second word: aaaaaaaaaaaaaahhhhhhhhhhhyyyyyyyyyyyyeeeeeeeelllllllllllkjjjjjjjjjjjoooooppppppppYESExample #2Enter first word: HELLOEnter second word: helloYESExample #3Enter first word: HeLlOEnter second word: hElOlNO

1. Begin the function is_subsequence with input strings a and b 2. Initialize two variables i and j…

Answered: please slove this question in c. don't…

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

please slove this question in c. don't copy other's code. thanks

Word A is considered a subsequence of another word B if A can be obtained by deleting 0 or more characters from string B. Given two words composed of lowercase and uppercase letters, can you check if A is a subsequence of B in a case-insensitive manner?

Requirements

Assume the input length for the two strings is no more than 1000 characters.
String library functions are NOT allowed.
Character handling functions such as tolower() are allowed.
Follow the format of the examples below.
The program will read two words, then print YES if the first word is a subsequence of the second word, and NO otherwise.

output:

Examples (your program must follow this format precisely)

Example #1

Enter first word: HeLlO
Enter second word: aaaaaaaaaaaaaahhhhhhhhhhhyyyyyyyyyyyyeeeeeeeelllllllllllkjjjjjjjjjjjooooopppppppp
YES

Example #2

Enter first word: HELLO
Enter second word: hello
YES

Example #3

Enter first word: HeLlO
Enter second word: hElOl
NO

Expert Solution

Step by step

Solved in 3 steps with 4 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