Give an example of a decision problem that is in the complexity class ExP but not in P. Present a rationale for your choice.
A. Sorting a list of integers in ascending order
B. Determining if a given number is prime
C. Finding the shortest path between two nodes in a weighted graph
D. Finding the optimal solution to the traveling salesman problem