a) Based on the given flows between processes, one should ensure that the processes B and are in adjacent rooms as they have the highest number of moves between each other. Based on the given flows between processes, one should ensure that processes A and are in adjacent rooms as they have the second highest number of moves between each other. Based on the given flows between processes, one should ensure that processes D and are in adjacent rooms as they have the third highest number of moves between each other. The goal is to assign the processes to the work areas in a way that minimizes the total flow, using a method that places processes with highest flow adjacent to each other. Work stations for processes and E have been already determined. Using the "highest flow adjacent to each other" rule, work station 5 should have: Using the "highest flow adjacent to each other" rule, work station 1 should have: Using the "highest flow adjacent to each other" rule, work station 1 should have: Using the "highest flow adjacent to each other" rule, work station 3 should have: For the layout that you have developed based on the preassigned work stations for processes C, D, and E, the cumulative "load distance" or "movement cost" =2 feet (enter your response as a whole number). b) The goal is to assign the processes to the work areas in a way that minimizes the total flow. For an alternate layout, work stations for processes C, D, E, and F have been already determined. Work statio should have process: Work station 1 should have process: The cumulative distance for the improved layout = feet (enter your response as a whole number)