SDN implementation of Dijkstra$$s algorithm: Consider the implementation of Dijkstra$$s algorithm in an SDN framework. Which of the following statements are true? $($Hint: more than one statement is true.$)$

A$)$If a router$$s forwarding table should be changed as a result of running Dijkstra$$s algorithm, the new flow table for that router will be updated by the SDN controller via the southbound API using the Openflow protocol.

B$)$ If a router$$s forwarding table should be changed as a result of running Dijkstra$$s algorithm, the implementation of Dijkstra$$s algorithm will determine the routers needing updated flow tables, and send the new flow tables to them directly using the OSPF protocol.

C$)$ When executing, Dijkstra$$s algorithm will need to send messages to all of the routers to gather their link costs.

D$)$ When executing, Dijkstra$$s algorithm will run as a network control application $$on top$$ on the SDN controller.

E$)$ When executing, Dijkstra$$s algorithm will execute within the operating system of the SDN controller

F$)$ When executing, Dijkstra$$s algorithm will use the link$-$state database that is maintained within the SDN controller.