Which one is true for the problem complexity?

a$.$

Some of the Integer Programming problems like Shortest Path are in P$.$

b$.$

Some of the Integer Programming problems like Fractional Knapsack are in P$.$

c$.$

All of the Linear Programming problems like Binary Knapsack are in NP$.$

d$.$

Some of the Linear Programming problems like Facility Location is in NP$.$