Given the following key values: DOLL, STOP, BOOK, BAGS, MUGS, TREE, HENS, PURE, LETS, FAST (a) Determine their numeric values or keys by getting the sum of the ASCII numeric equivalents of their characters (e.g. The ASCII representation of CAR is 67, 65, 82 with numeric value of 214).

n and n+1 are integers with the same number of positive divisions. Find the integers n from 1<n<107. For example, the positive divisors of 14 are 1, 2, 7, 14, and 15 are 1, 3, 5, 15. (P.s.: You have to done it by C++.)

Please help me in C++ I just need help with my ceasar cipher and decipher function please help

Code C  Can this be done as a flowchart please? Detailed and clear This week’s exercise is to implement an encoder. When completed, your program should be able to accept a short sentence from the user and display an encrypted version of it. Encryption is a complex subject but we can implement a very simple example as follows. For simplicity, let us assume one case of letters throughout, say CAPITALS. We can use a substitution method to scramble a sentence and then use the reverse of this process to recover it. If we take two rows of the alphabet and shift the bottom row along a specified amount (our key), we can then read the letters in our sentence from the top row and use the substituted letter from the bottom row to form the encrypted sentence: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z X Y Z A B C D E F G H I J K L M N O P Q R S T U V W In the example above, the key is 3, hence the second row is shifted by three characters along. Take, for instance, the sentence “HELLO”.…