Assume that source elements of length k are mapped in some uniform fashion into a target elements of length p. if each digit can take on one of r values, then the number of source elements is rk and the number of target elements is the smaller number rp. a particular source element xi is mapped to a particular target element yj.

a. what is the probability that the correct source element can be selected by an adversary on one try?
b. what is the probability that a different source element xk (xi, xk) that results in the same target element, yj, could be produced by an adversary?
c. what is the probability that the correct target element can be produced by an adversary on one try?

Write a program that keeps asking the user for new values to be added to a list until the user enters 'exit' ('exit' should not be added to the list). these values entered by the user are added to a list we call 'initial_list'. then write a function that takes this initial_list as input and returns another list with 3 copies of every value in the initial_list. finally, inside print out all of the values in the new list. for example: input: enter value to be added to list: a enter value to be added to list: b enter value to be added to list: c enter value to be added to list: exit output: a b c a b c a b c note how 'exit' is not added to the list. also, your program needs to be able to handle any variation of 'exit' such as 'exit', 'exit' etc. and treat them all as 'exit'.

Which computer tools allow you to communicate with coworkers, family,and friends

Once a vulnerability has been identified by nessus, where would you check for more information regarding the identified vulnerability, exploits, and any risk mitigation solution?