Consider a flow network (g= (v, e), s, t,{ce}). the capacity of a path from s to t is defined as the minimum capacity of its edges. give an algorithm to find a path from s to t of maximal capacity. describe your algorithm with words (no pseudocode) and analyze its running time.

An engine, weighing 3000 n, is supported on a pedestal mount. it has been observed that the engine induces vibration into the surrounding area through its pedestal at the maximum operating speed. determine the stiffness of the dynamic vibration absorber spring in (n/m) that will reduce the vibration when mounted on the pedestal. the magnitude of the exciting force is 250 n, and the amplitude of motion of the auxiliary mass is to be limited to 2 mm note: in this question type-in right numbers, no decimals, no fractions, no unit. approximate to right number if needed