Which of the following problems is an example of an NP$-$complete problem?

a$)$ Sorting a list of numbers

b$)$ Finding the shortest path between two nodes in a graph

c$)$ The traveling salesman problem

d$)$ Matrix multiplication