Please solve and show all work. What is the advantage of web caches, and how does it work?

Please solve and show steps.   Consider a DASH system for which there are N video versions (at N different rates and qualities) and N audio versions (at N different rates and qualities). Suppose we want to allow the player to choose at any time any of the N video versions and any of the N audio versions. If we create files so that the audio is mixed in with its matched-rate video and the server sends only one media stream at a given time, how many files will the server need to store (each with a different URL)? If the server instead sends the audio and video streams separately and has the client synchronize the streams, how many files will the server need to store?

Please solve and show all work. Recall that TCP can be enhanced with SSL to provide process-to-process security services, including encryption. Does SSL operate at the transport layer or the application layer?

Please solve and show all work. Compute the checksum of the words 1011 1001, 1001 1110, and 0111 1011. Show all work.

Please solve and show all work.   Suppose you can access the caches in the local DNS servers of your department. Can you propose a way to roughly determine the Web servers (outside your department) that are most popular among the users in your department? Explain

Please solve and show all work. Thank you. Suppose Host A sends two TCP segments back to back to Host B over a TCP connection. The first segment has sequence number 120; the second has sequence number 170. How much data is in the first segment? Suppose that the first segment is lost but the second segment arrives at B. In the acknowledgment that Host B sends to Host A, what will be the acknowledgment number?

In Matlab script, how would you compute a Reimann sum to approximate the area under the  y=sin(x) from a =0  to b = p1/2  with  n=6 subintervals using left-endpoints. Use for loop. Assign the result to Lsum.

please solve using the first step i did which was c(n,n) = 1/C(5,5) = 1. <n=5> P(n,n) = n!/p(8,8)= 8! <n=8>

Consider a list of n unique ordered integers, where you are allowed to remove m of them. The goal is to maximize the distance between the remaining closest numbers. As an example, consider the list [1, 4, 5, 6, 8, 9], where we are allowed to remove two numbers. Here, an optimal solution would be to remove the numbers 5 and 8, leaving us with the list [1,4,6,9]. The distance between the closest remaining numbers is 2 (between 4 and 6). The proposed greedy algorithm to this problem is to take a pair of numbers which are currently closest together and remove the one which would result in the better solution. Using [1, 4, 5, 6, 8, 9] again as an example, the greedy algorithm would look at one of the closest pairs of numbers (4,5), (5,6) or (8,9). Without loss if generality assume it examines the pair (4,5), 5 is closer to 6 than 4 is to 1, so the algorithm would choose to remove 5, leaving the list [1,4,6,8,9]. The algorithm would then look again at a closest pair of numbers, (8,9) and…