please help me with the following homework problems for cs

1. A node p of a directed graph G = (N,E) is called a sink node if for every node v N and v = p, the edge from v to p exists but the edge from p to v does not exist. Write an algorithm that can detect the presence of a sink in G in linear time (i.e., O(n)).

2.) Write a function in your language of C++ that, given an unsigned integer storing a bit pattern and an unsigned integer with a search bitstring, returns an integer whose contents have been left-shifted so that the search pattern is in the leftmost bit position of the integer. NOTE: Dont forget that were working with integers storing binary data, not character strings. This means that you will need the c++ bitwise support.(ex: right shift)