For this project, you will write a program that implements the Path Vector Routing Algorithm. Must upload a Word or PDF file only. Justify the use of the programing language in your design section.

Design: Code: Output:

Path_Vector_Routing ( // Initialization for (y=1 to N) if (y is myself) Path[y] = myself else if (y is a neighbor) Path[y] = myself + neighbor node else Path[y] = empty Send vector (Path[1], Path[2], ..., Path[y]) to all neighbors // Update repeat (forever) from a neighbor w) wait (for a vector Path for (y= 1 to N) if (Pathy includes myself) discard the path // Avoid any loop else Path[y] =best {Path[y], (myself + Path [y])} If there is a change in the vector) Send vector (Path[1], Path[2], ..., Path[y]} to all neighbors 28 } // End of Path Vector Path_Vector_Routing ( // Initialization for (y=1 to N) if (y is myself) Path[y] = myself else if (y is a neighbor) Path[y] = myself + neighbor node else Path[y] = empty Send vector (Path[1], Path[2], ..., Path[y]) to all neighbors // Update repeat (forever) from a neighbor w) wait (for a vector Path for (y= 1 to N) if (Pathy includes myself) discard the path // Avoid any loop else Path[y] =best {Path[y], (myself + Path [y])} If there is a change in the vector) Send vector (Path[1], Path[2], ..., Path[y]} to all neighbors 28 } // End of Path Vector