Given the disjoint set array shown, what would the array look like after a find(10) if path compression is used? ____________________________________________ | -1 | 0 | 0 | 2 | 2 | 1 | 1 | 5 | 5 | 8 | 9 | -------------------------------------------- 0 1 2 3 4 5 6 7 8 9 10     Illustrate the trees for the final forest of the previous problem.

Let's say p contains a memory address and the 8 bytes in memory beginning at that address are (in hex): 01 12 23 34 45 56 67 78. If p's type is "uint32_t *", what is the value of x on a little-endian computer after executing: uint32_t x = p[0]; Ox01122334 Ox0112233445566778 Ox34231201 Ox7867564534231201 O O O O

Write a program, led_pb.c, compiled with GCC on the RPi 3b/3b+, that performs the following steps using the provided sysfs_gpio files:a. Include the sysfs_gpio.h fileb. Initializes the LED pin to be an output by calling gpioOutput()c. Initializes the switch pin to be an input by calling gpioInput()d. Turns on the LED using gpioWrite()e. Enters a while loop that calls gpioRead() and waits for the switch to read 1f. Turns off the LED using gpioWrite() sysfs_gpio.h :#ifndef SYSFS_GPIO_H_#define SYSFS_GPIO_H_ // Called to configure the pin as an input or outputvoid gpioOutput(int pin);void gpioInput(int pin); // Called to set and output pin to a given value (1 or 0)void gpioWrite(int pin, int value); // Called to get the status (1 or 0) of a pinint gpioRead(int pin); #endif