Give an algorithm that, given an undirected graph g and node s, creates an array shortestcount in which shortestcount[i] is the number of shortest paths from s to vertex i. provide a proof by induction that your algorithm is correct. derive its runtime. (tip: start with the bfs algorithm as given in the text, in which nodes are organized into layers li based on distance from s, and update the counts as you build the tree.)

Find the kinematic pressure of 160kpa. for air, r-287 j/ kg k. and hair al viscosity of air at a temperature of 50°c and an absolute (10 points) (b) find the dynamic viscosity of air at 110 °c. sutherland constant for air is 111k

Air inially occupying a volume of 1 m2 at 100 kpa, 27 c undergoes three internally reversible processes in series. process 1-2 compression to 500 kpa during which pv constant process 2-3 adiabatic expanslon to 100 kpa process 3-1: constant-pressure expansion to 100 kpa (a) calculate the change of entropy for each of the three processes. (b) calculate the heat and work involved in each process. (c) is this cycle a power cycle or refrigeration cycle?

The maximum shear stress and maximum flexural stress occur at the same location along a beam subjected to a non-uniform bending load. a)-trune b)- false