please type it down instead of writing it

There is an array Al..n of integers. You have to compute an array Bl[1..n such that B[i] = 11-15i AG. Write down the pseudocode for an iterative algorithm that solves it in linear time, without using the division operator. Prove its correctness using loop invariants. You can ignore overflow issues