modify the Bellman-Ford algorithm to find and print a negative weight cycle (reachable from the source, s) in a weighted directed graph G if one exists

Show how to modify the Bellman-Ford algorithm to find and print a negative weight cycle (reachable from the source, s) in a weighted directed graph G if one exists. If there is no negative weight cycle, your algorithm should print out "NO NEGATIVE WEIGHT CYCLE REACHABLE FROM s". If there is a negative weight cycle reachable from the source vertex, your algorithm should display one such cycle.

ternary trees

Consider a ternary tree, in which each node has 3 children. What are the maximum and minimum number of nodes in a ternary tree of height h?

converting ternary to binary

Write the pseudocode for a recursive function TERNARY TO BINARY, that will convert a ternary tree into a binary search tree.

Heap algorithm implementation

Please look at question number 4 on the pdf attachment on the sample final exam. Thanks

Converting a ternary tree to a binary tree

Please look at question number 3 on the attached pdf file of the sample final exam. Thanks