Consider the following problem for demonstrating the algorithm.Basic Data:1. Number of departments in the layout = 7.2. Areas of departments:DepartmentFunctionArea ()1Receiving12,0002Milling80003Press60004Screw machine12,0005Assembly80006Painting12,0007Shipping12,000Total70,0003. The Relationship Chart:From1—2E—30U—4IEU—5OIUI—6UI0uA—7UUuuIE—To1234567For our computational convenience, the triangular matrix is represented in a rectangular matrix form as shown below.Relationship chart12345671—E0IOUU2E—UEIIU30U—UUoU4IEU—IuU5OIuI—AI6UIoUA—E7UUuuIE—4. Minimum department preference (MDP) value = 1 = 4.5. Sweep width = 26. Number of iterations to be performed = 2.Apply ALDEP algorithm to design a suitable layout.