Topological sort requires only a tiny addition to the dfs algorithms. exactly one of the following data structures is required to make it work (although the code in the textbook uses one is essential.)
question 1 options:
queue
deque
stack
hash table

Write a function named printfloatrepresentation(float number) that will print the floating point representation of a number using the format given below. (sign bit) exponent in binary (assumed bit).significandfor example if the number passed an argument is 71 yourprogram should print (0) 10000101 (1).00011100000000000000000similarly if the number passed to the function as argument is -71 the program should print (1) 10000101 (1).00011100000000000000000