Finding the streaks

You will write three functions. The first finds the longest streak in a list of tosses. The second counts the streaks of a given length, and the third simulates the longest streak in $100$ tosses.

The idea. Walk along the list and keep a counter of how many equal results you have seen in a row. When the result changes, the counter goes back to $1$. In $100$ fair tosses, a streak of $5$ or more equal faces is very common.

Your tasks.

1. Finish longest_run(tosses). Return the length of the longest block of equal results in a row.
2. Finish count_runs(tosses, k). Return how many blocks of equal results are $k$ or more long.
3. Finish share_with_run(trials, k). Simulate trials sequences of $100$ tosses and return the share that have a run of k or more.