1. Build PDA to generate all strings of the form 1n0 n where n>0

Caesars Cypher in C programming language How do you program an encryption and decryption for a Caesars Cypher that covers all the possible ASCII characters?  In this there should be a shift over K = 5 but the example below is K = 3.  This should result in actual character and not the control ASCII represenations. For example:  >>> $ encrypt(I have a key)N%mf{j%f%pj~>>> $ encrypt(see me at 3)xjj%rj%fy%8>>> $ decrpyt(|jfw%ns%gqzj)wear in blue Assume that the text parsing method has been succesful and it's the encryption/decryption of the char array that needs to be factored.    Formula Encryption -> C = E(k, P) = (P + k) (mod 26) Decryption -> P = D(k, C) = (C - k) (mod 26) Where k = 5

(4) {w € [0, 1]* : w does not have 001 as a substring} Testing strings: €, 0, 1, 01, 000, 001, 0001, 0010, 0101, 11000, 110010 The accepted strings are: L U E O 01 000 001 0001 ☐ 0010 0101 11000 110010

II. Determine the big-O measure for each of the functions in the lower table. Choose from the various big-O measures in the upper table. A. O(1) G. O(Y) M. O(Y¹6) S. O(N log N) Y. O(W!) EE. O(X³Y) B. O(X) H. O(log Y) N. O(Z) T. O(N²) Z. O(67W) C. O(log X) I. O(Y log Y) O. 0(Z²) U. O(N²log N) AA. O(V) D. O(X log X) J. O(Y²) P. O(Z³) V. O(W³) BB. O(VV) E. O(X²) K. O(Y³) Q. O(log N) W. O(W⁹) CC. O(25¹) F. O(X³) L. O(Y¹5) R. O(N) X. O(9W) DD. O(XY)