I've encountered a problem, wchich sounds like this:

Mike has 25 roses and 5 friends. He wants to give the roses to his friends, in a way, that no friend is left without a rose, and no friend gets more than 7 roses. How many ways are there to distribute the roses among his friends? All roses are indistinguishable

I've managed to write this problem down as
$$x\_1 + x\_2 + x\_3 + x\_4 + x\_5 = 25 $$
where
$$ 1 \leq x\_1, x\_2,x\_3,x\_4,x\_5 \leq 7$$

I struggle to approach the problem