Let G be a directed, weighted graph on n vertices and m edges. A particular vertex is marked as the source vertex s$.$ Consider the problem of deciding if the graph contains a path of total weight at least k$,$ starting from vertex s$.$

Show that this problem is NP$-$complete. You must use a reduction from one of: TSP$,$ Hamiltonian Path, Subset Sum, Clique.