Let's imagine you have a scenario where you have $n$ Palestinian universities, and you're required to distribute an Excel sheet to be filled out. The process begins with university $x,$ which edits it and then passes it on to another university. This chain continues, with each university editing and forwarding until every university has participated.

The following graph is just an example of $n$ This arrangement can be represented as a Helwork with It $Y$ "universities connected with Edirect ${?}^2$ edges. If the detaited timecomptexity of the algorithm applied is VE$,$ what would be the overall order complexity interms of $n^2?$