Class, we saw that packet switching can make more efficient use of resources by takingadvantage of the fact that only a fraction of potential senders are active at any time. In this problem, you will beasked to demonstrate this fact mathematically. Suppose we have a single link with capacityLbits per second and apopulation of users that generate data atrbits per second when busy. The probability that a user is busy generatingdata isp. A. What is the maximum number of users that can be supported using circuit switching? Call this value MC.
B. Now suppose we use packet switching to support a population of MP users. Derive a formula (in terms of p, MP, N, L, and r) for the probability that more than N users are busy.
C. Plug in some numbers. Let L = 1 Mbps, r = 64 Kbps and p = 0.1. Give the value for MC. What is the probability that more than MC users are busy for MP = 2MC? What about MP = 4MC?

Technician a says engine assemblies can be mounted longitudinally in a chassis. technician b says engine assemblies can be mounted transversely in a chassis. who is correct?

In a heat transfer course, we can derive the equation for the temperature distribution in a flat rectangular plate. in this example, we will look at a plate at steadystate with three sides being held at t1, and one side held at t2. the temperature for any location on the plate, t(x,y), can be calculated by where create a function (prob3_5) that will take inputs of vectors x and y in feet, scalar n, scalars l and w in feet and scalars t1 and t2 in degrees fahrenheit. it will output a matrix t which is the temperature of each x and y locations. t will have the number of columns equal to the number of elements in x and rows equal to the number of elements in y. though this can be done without loops (perhaps more efficiently), your program must use a nested loop.

Create a function (prob3_6) that will do the following: input a positive scalar integer x. if x is odd, multiply it by 3 and add 1. if the given x is even, divide it by 2. repeat this rule on the new value until you get 1, if ever. your program will output how many operations it had to perform to get to 1 and the largest number along the way. for example, start with the number 3: because 3 is odd, we multiply by 3 and add 1 giving us 10. 10 is even so we divide it by 2, giving us 5. 5 is odd so we multiply by 3 and add one, giving us 16. we divide 16 (even) by two giving 8. we divide 8 (even) by two giving 4. we divide 4 (even) by two giving 2. we divide 2 (even) by 2 to give us 1. once we have one, we stop. this example took seven operations to get to one. the largest number we had along the way was 16. every value of n that anyone has ever checked eventually leads to 1, but it is an open mathematical problem (known as the collatz conjectureopens in new tab) whether every value of n eventually leads to 1. your program should include a while loop and an if-statement.