Please DO NOT give error.Use c$++.$use cycle.h$,$cycle.cpp$,$cyclemain.cpp into multiple files.Please output should match with sample output. Thank you Objectives $-$ Finding a Single Source Shortest Path and Detect a Negative Cycle with Bellman$-$Ford Algorithm

Write a program to find single source shortest paths from source to all vertices and detect the negative$-$weight cycle using Bellman$-$Ford algorithm. The program receives the inputs from users:

Number of vertices, number of edges, and starting source,

Properties of each edge: source vertex, destination vertex and weight.

Notes: You are given two sample outputs. These will help to check the logic of your program. When grading your program, I will enter the new data sets.

Sample Outputs

$\backslash$table$[[\backslash$table$[[$Sample Output $1],[($without a negative cycle$)]],,,\backslash$table$[[$Sample Output $2],[($with a negative cycle$)]]]]$