Exercise 1: 1. Write a LabVIEW vi that finds all the factors of an integer number N. The factors Pi are all the integers such that the integer division of N by Pi has a remainder 0.The factors P are stored in an array in ascending order. The number 1 which is a factor for all integers is at index 0 of the array. Select the data type for N such that N is always positive (U32 would be a good choice). Make this vi into a subvi by creating an icon and assigning the number N and the array of factors as the input and the output of the subvi on the connector pane. Write a new vi that runs continuously until the user presses a stop button. The new vi calls the subvi to compute and display all the factors of an integer number. This number can be changed while the vi is running, which changes the factors displayed on the front panel of the new vi. 2. 3. Exercise 1: 1. Write a LabVIEW vi that finds all the factors of an integer number N. The factors Pi are all the integers such that the integer division of N by Pi has a remainder 0.The factors P are stored in an array in ascending order. The number 1 which is a factor for all integers is at index 0 of the array. Select the data type for N such that N is always positive (U32 would be a good choice). Make this vi into a subvi by creating an icon and assigning the number N and the array of factors as the input and the output of the subvi on the connector pane. Write a new vi that runs continuously until the user presses a stop button. The new vi calls the subvi to compute and display all the factors of an integer number. This number can be changed while the vi is running, which changes the factors displayed on the front panel of the new vi. 2. 3