Consider the following weighted graph:

Solve the Chinese Postman Problem $($find the shortest closed walk using each edge exactly once$).$

$2.$ Find all possible RNA chains given the following decomposition:

G$-$fragments: UCAG CUG $G$ ACG $CA,G$

UC$-$fragments: GAC $U$ A GC AGGC C GU

For the following tournaments #$3$ and #$4$

a$)$ What is the score of each of the vertices?

b$)$ Is it transitive? Why or why not?

c$)$ Find all Hamiltonian paths in the tournament.

$3.$

$4$

$5.$ Find the shortest amount of time required to solve the following scheduling problem:

$\backslash$table$[[$Job$,$Time Required$],[$A$,2],[$B$,6],[$C$,3],[$D$,2],[$E$,3],[$F$,4],[$G$,3]]$

Prerequisite None

A

B

$B$&$C$

$D$

D & E

F