Consider a linear program with feasible region 2 C R", objective f(x) = c x, and feasible point y E int($2). Provide an algorithm for finding a unit-length direction vector d E R", derived from any randomly-generated vector w E R" , which satisfies y + ad E int() and c d 0. Explain why such an algorithm could be useful in an interior-point method scenario