Create a program in Java to define their Vs and Es$.$

Two separate paths from Sacramento to Boston:

Path $1$:

Leave Sacramento $($SMF$)$ at $6$:$26$am for an $1h26m$ flight. Layover in Boise $($BOI$)$ for $1h53m$ at $8$:$52$am$.$ Leave Boise at $10$:$45$am for an $1h29m$ flight to Seattle $($SEA$).$ Layover in Seattle for $4h21m.$ Leave Seattle at $3$:$35$pm for a $5h24m$ flight to Boston $($BOS$).$ Arrive in Boston at $11$:$59$pm$.$

Path $2$:

Leave Sacramento $($SMF$)$ at $6$:$13$pm for an $1h37m$ flight. Layover in Los Angeles $($LAX$)$ for $4h47m$ at $7$:$50$pm$.$ Leave LA at $12$:$37$am for a $3h43m$ flight to Minneapolis $($MSP$).$ Layover in Minneapolis for $40m.$ Leave Minneapolis at $7$:$00$am for a $2h50m$ flight to Boston $($BOS$).$ Arrive in Boston at $10$:$50$am$.$