The goal of this exercise is to find the endpoint node of a simple network. In this simple network, each node is linked to at most one outgoing node in a one way forward direction. 1 7 3 2 4 6 A simple network example 9 5 Implement function find_network_endpoint (startNodeId, fromIds, toIds) which should return the last node id of the network found when starting from the node with id startNodeId and following the links of the network. In the above example, the endpoint node when starting from node #2 (or any other node) is node #5. fromIds and toids are two arrays of the same length which describe the one- way links of the network (fromIds[i] is linked to toIds [i]). In case you run into a loop when traversing the network, the function should return the id of the last node traversed before closing the loop. Constraints: . 0 < number of links < 10000 A node cannot be directly linked to itself Available RAM: 512MB Timeout: 1 second 3 1 #include > #include #include #include #include using namespace std; int find_network_endpoint (int startNodeId, vector fromIds, vector toIds) { // Write your code here // To debug: cerr < < < "Debug messages..." < < endl; 2 3 4 5 16 } 17 18 /* Ignore and do not change the code below */ 19> #pragma region- return 0;