1. Write a python function create frequency that tske a string and finds the frequency of each word in a given string .return the results in dictionary from like
2.  

Write a function find_decrypted_words() that takes a file name as parameter, reads that text file and decrypts all of the words by using previously created decode_string() function (in part-4). The function will print perfectly decrypted words and the number of deficient ones. If all characters converted successfully it means that the string is decrypted perfectly (i.e. no "?" in decrypted string).

Write a Python statement that calls the above defined function with the file "encryptedwords.txt".

Part-5:

Decoding encrypted words...

Decoded words:

ALERT

TREX

33  number of words cannot decrypted succesfully

Check Substring You are given two strings s1 and s2. Write a function isSubstring(char s1[], char s2[]) which takes two strings as input, and returns the start index if the second string is a substring of the first, else returns -1. (Case Insensitive) Note: Print the result in the main() function. 4.1

Example 4.1.1

Input:

Starfish

Star

Output: 0

4.1.2

Input:

Starfish

Fish

Output:

4

4.1.3

Input:

Exhibition

habit

Output:

-1

please use c language and use function method to solve it

Check Substring You are given two strings s1 and s2. Write a function isSubstring(char s1[], char s2[]) which takes two strings as input, and returns the start index if the second string is a substring of the first, else returns -1. (Case Insensitive) Note: Print the result in the main() function.

4.1 Example

4.1.1

Input: Starfish

Star

Output:

0

4.1.2

Input:

Starfish

Fish

Output: 4

4.1.3

Input: Exhibition habit

Output: -1