A deterministic program is one that uses no random choices. Suppose L$1$and L$2$ are two deterministic libraries with a common interface. Show that either L$1$ L$2,$ or else L$1$ & L$2$ can be distinguished with advantage $1$