# Stuck need help! The class I’m taking is computer science discrete structures. Problem is attached. view both attachments before answering. with

Excerpt
|x| where |x| is the cardinality of the set of characters in that string. Support or refute the following statements. Explain your reasoning. a) The function as defined is 1-1. b) The function as defined is onto. c) The function as defined is reliably invertible.

Stuck need help! The class I’m taking is computer science discrete structures. Problem is attached. view both attachments before answering. with parts A,B, and C. * is each statement true or false? Please explain answer so I can fully understand. Really struggling with ts concept. Thank you so much. Transcribed Image Text: Let Set A
{the quick brown fox jumped over the lazy dog} be a set of strings (two or
%3D
more characters) formed by characters (single letters) in the standard alphabet.
Enumerate (assign numbers to) the alphabet as
A
В
C
E
F
K
M
P
Q
V
W
Y
1
3
4
5
7
8
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
Consider the following encryption algorithm written in pseudo code:
Encrypt(set):
define f (x) = x + 13 mod 26.
Now,
Vx E characters of A,
If x = 14 mod 26,
> f (x)
Then x →
If not,
Then x → X Transcribed Image Text: Suppose we
define a function on the set {strings in A} by
f:{strings of A} → N
f(x) = |x| where |x| is the cardinality of the set of characters in that string.
Support or refute the following statements. Explain your reasoning.
a) The function as defined
is 1-1.
b) The function as defined
is onto.
c) The function as defined
is reliably invertible.