Alice has an item x and Bob has a set of five distinct items y1, y2, y3, y4 and y5. Design a protocol through which Alice (but not Bob) finds out whether her x equals any of Bob's five items; Alice should not find out anything other than the answer ("Yes" or
"No") to the above question, and Bob should not know that answer or any secret from Alice. Do not use a hash-based solution
because even though the probability of a colission is small, Alice requires that no such colission can occur (but using encryption
is fine, because in that case two distinct items that are encrypted with the same key will result in two different ciphertexts)

Usually, when we sniff packets, we are only interested certain types of packets. we can do that by setting filters in sniffing. scapy’s filter use the bpf (berkeley packet filter) syntax; you can find the bpf manual from the internet. set the following filters and demonstrate your sniffer program again (each filter should be set separately): (a) capture only the icmp packet. (b) capture any tcp packet that comes from a particular ip and with a destination port number 23. (c) capture packets comes from or to go to a particular subnet. you can pick any subnet, such as 128.230.0.0/16; you should not pick the subnet that your vm is attached to.

Where can page numbers appear? check all that apply. in the header inside tables in the footer at the bottom of columns at the top of columns

Learning sign language is an example of a(n) learning sign language is an example of a(n)