Write using TCL commands (Cryptography) Write an invert procedure, that outputs the inverse of a permutation; for example, [invert {3 2 5 1 4}] should return {4 2 1 5 3}.

Need help with this c++ problem In encryption, plain text is the normal, human-readable text. Cipher text is the encrypted message. These are the two functions you'll be writing. One will encrypt plain text and the other will decrypt cipher text. void cipher(istream& in, ostream& out, unsigned key)void plaintext(istream& in, ostream& out, unsigned key) You are going to read from the parameter in and write to the parameter out. Treat the two parameters, in and out, just as you would cin and cout. In fact, if you want to encrypt the characters you type from the keyboard, and have the output appear in the console, you can just call cipher(cin, cout, 5) from your run function and everything that you type will be shifted to the right by five characters. Both of these functions are filter functions, so they will use data loops. Here is the pseudocode for the cipher() function: cipher(in, out, key):read each character (c) from inshift the character c right by keywrite c to out…

1. Error in line 2 2. Error in line 3 3. Error in line 4 4. Error in line 6 5. Error in line 7 6. No error

In c++, please. Thank you!   Given a main() that reads user IDs (until -1), complete the BubbleSort() functions to sort the IDs in ascending order using the Bubblesort algorithm, and output the sorted IDs one per line. You may assume there will be no more than 100 user IDs. Ex. If the input is: kaylasimms julia myron1994 kaylajones -1 the output is: julia kaylajones kaylasimms myron1994   The following code is given:   #include <string>#include <iostream> using namespace std; // TODO: Write the Bubblesort algorithm that sorts the array of string, with k elementsvoid Bubblesort(string userIDs [ ], int k) { } int main() {   string userIDList[100];   string userID;    cin >> userID;   while (userID != "-1") {      //put userID in the array      cin >> userID;   }    // Initial call to quicksort   Bubblesort(userIDList, /* ?? */ );   //make this output only the userIDs that were entered, not garbage   for (int i = 0; i < 100; ++i) {       cout <<…

Generate a PDA that accepts the following: Given an alphabet of a, b, c and null, only accept strings that consist of random characters But the number of 'a' characters exceeds the sum of the number of 'b' and 'c' characters.

In Java This assignment introduces bitwise-manipulation operators (&, |, <<, >>, >>>, ^, and ~),which are not discussed elsewhere in the book. The bitwise-manipulation operators performsimultaneous bit manipulations and enable programs to process large quantities of binaryinformation efficiently. This project is here because the solution uses a conditional operator.The binary & and | operators can implement bitwise “and” and “or” operations oncorresponding bits in a pair of 32-bit int operands. This bit-manipulation capability enablesJava to efficiently process large quantities of raw binary information. We use this capability toencrypt information sent over the Internet and to process graphical images. Suppose you havea 32-bit pattern of 1’s and 0’s in an integer called mask. You can use mask to either set to 1or reset to 0 any subset of the bits in another integer called data:• data |= mask;1 drives to 1 all bits in data that correspond to 1 bits in…

Create a random password generator with two functions and three parameters. Your code must be organized using mainline logic.

java  random matches. Write a BinarySearch client that takes an int value T as a command-line argument and runs T trials of the following experiment for N = 103, 104, 105, and 106: generate two arrays of N randomly generated positive six-digit int values, and find the number of values that appear in both arrays. Print a table giving the average value of this quantity over the T trials for each value of N.

public boolean isprefix(String s1, String s2) {int i = 0;if(s1.length > s2.length) return false;while(i < s1.length) {if(s1[i] != s2[i])return false;i++;}return true;}   Use the active operation approach and determine the exact number of times the active operation is executed in the worst case.  Express your answer in terms of n, the length of the string s1. Hint:  simplify your final answer as much as possible, and do not put spaces in your answer.  Use juxtaposition for the multiplication operator, for example to write "nine times n" write "9n" not "9xn" or "9*n";  to write "four times (n+2)" write "4(n+2)", not "4x(n+2)" or "4*(n+2)".  Do not write your answer in Big-O notation.  Write the exact number of lines executed.

solve a given problem