Combinatorics problem. how many permutations of the set [n] are there in which no internal entry is larger that both of its neighbors? (internal = not at the end points) [n] = {1, 2, n-1, n}

can i use the equation:

k! (n-k)! to solve this? i'm not sure how to show the internal entry part of the problem

30 points! here is a you are the new manager at trusty goods wholesale produce. you need to figure out how to adjust the amount of produce in your notes after the events of the day: you got 5 more crates of bananas someone returned 2 crates of apples a worker dropped a crate of grapes (oh no! , you had to throw them out) you sold a crate of bananas you sold 5 crates of apples can you write an expression to describe your day using: "a" for crates of apples "b" for crates of bananas and "g" for crates of grapes? make sure the expression is in simplest form question 2 (3 points) explain your steps using sentences.