In this problem you will write a function that takes in a single integer (positive, negative, or zero) and produces an array of all of its individual digits along with a boolean which flags if the number is negative (often called the sign bit). the list of digits should begin with the lowest place and increase to the highest place. main function:

input variables: • a scalar representing the integer to be studied
output variables: • a vector of each digit in the order from lowest place to highest place

• a scalar boolean which is 1 if the number is negative and 0 otherwise a possible sample case is: » [digits, sign] = lxx_qyy(1234) digits = 4 3 2 1 sign = 0 » [digits, sign] = lxx_qyy(-9) digits = sign %3d

The solution code is written in Python 3.

Explanation:

Firstly, let's create a function LXX_QYY() that take one input number, num. (Line 1 - 20)

Since one of the output is a vector of digit, we create a new list, num_list to hold the vector of digit.

Prior to generating the vector of digit, we need to handle two possible types of number, which are positive and negative. Define an if-else statement (Line 3 & 11).  If the number is positive, program will go through Line 4 -10, else Line 12 - 20. One different between this two parts of codes is that, if the number is negative, it is necessary to multiply the number with -1 to convert it to positive.

To capture the individual digit of the input number, we need to convert the number into string (Line 4) so that we can traverse through each of the digit using for loop (Line 7).

Besides, we also need to ensure the digit captured in order from lowest place to highest place. Therefore, we need to extract the digit one after another from the last index (Line 5) and then add it into the num_list (Line 8).

Next, we can return the num_list along with the sign 0 (if the number is positive) or 1 (if the number is negative) as a list.

At last, we can test the function with two sample cases (Line 22 & 26) and they shall give the output as:

0

[4, 3, 2, 1]

1

[8, 7, 6, 5]

answerdmz;