Can someone help me with this? I'm new at Pseudocode and help would really be appreciated. Can you also tell me how you came up with that as I want to understand it

Here is the problem,

Assume you have the following variables and values:

• An integer variable called num with some integer value.

• An integer array called numbers with n elements (n > 0)

  • Some integer values are stored in the first m slots of the array (0 <= m < n).

  • The m integers are already sorted in increasing order.

• Note: An integer value can be negative.

Write your pseudocode achieving the following requirements.

Insert the value of num into the array numbers. The resulting integers must be in increasing order.

Once num is inserted into numbers, update m so it indicates the correct number of items in the array.?

I tried doing it but stuck with this,

do copy from num to numbers[n] copy from m + 1 to m while (m < n)

Please help me I'm really confused and can you explain to me how you got it thanks.