Integer programming: Step function

Question

I am not sure how to solve the following question: Show how the following step function can be represented as a 0-1 expression

$f(x)=b_i$ where $a_{i-1} \le x \le a_i$ , $i=1,2,...n$

where $b_i>b_{i-1}$ for all i=1,2,...,n