Question: PLEASE ANSWER QUESTION (A). THANK YOU is a A case-insensitive permutation of the Latin alphabet A = {A, B, C, ..., Z, a, b, c,...,}
PLEASE ANSWER QUESTION (A). THANK YOU
is a A case-insensitive permutation of the Latin alphabet A = {A, B, C, ..., Z, a, b, c,...,} one-to-one map 4: A + A such that uppercase is mapped to uppercase; lowercase is mapped to lowercase; and (A) is the uppercase of P(a), (B) is the uppercase of '(b), and so on. Under a case-insensitive permutation Y of the Latin alphabet, the sentence "It is effort, kindness, passion, and zeal that are beautiful, charming, excellent, as well as quirky, not jealousy and vulgarity." is converted to the sentence "Ty tk joocwy, ftuvujkk, dikktcu, iuv hjig yliy iwj njiqytoqg, zliwxtus, jmzjggjuy, ik bjgg ik eqtwfa, ucy pjigcqka iuv rqgsiwtya." (a) Write a C++ program to determine the permutation. The program should display the value of the permutation at each letter as follows, where y(a) = i, p(b) = n, f(c) = z. and so on. a --> i b -->n C --> Z (7 marks) (b) The text in the given file named "converted.txt" has been converted from a text through the permutation 4. Write a C++ program to recover the original text and store the text in a file named "original.txt". (8 marks)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
